Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015 (2015), Article ID 350308, 12 pages
http://dx.doi.org/10.1155/2015/350308
Research Article

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, University Road, Westville, Private Bag X 54001, Durban 4000, South Africa

Received 4 November 2014; Accepted 12 January 2015

Academic Editor: Peng Liu

Copyright © 2015 Sivashan Chetty and Aderemi O. Adewumi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Brucker, Scheduling Algorithms, Springer, 5th edition, 2007.
  2. A. O. Adewumi, B. A. Sawyerr, and M. Montaz Ali, “A heuristic solution to the university timetabling problem,” Engineering Computations, vol. 26, no. 8, pp. 972–984, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. M. O. Adamu and A. O. Adewumi, “A comparative study of meta-heuristics for identical parallel machines,” Journal of Engineering and Technology Research, vol. 5, no. 7, pp. 207–216, 2013. View at Publisher · View at Google Scholar
  4. M. O. Adamu and A. O. Adewumi, “A survey of single machine scheduling to minimize weighted number of tardy jobs,” Journal of Industrial and Management Optimization, vol. 10, no. 1, pp. 219–241, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. A. A. N. Fateha, M. Y. Nafrizuan, and A. Razlan, “Review on elements of JIT implementation,” in Proceedings of the International Conference on Automotive, Mechanical and Materials Engineering (ICAMME '12), Penang, Malaysia, 2012.
  6. A. J. Kootanaee, K. N. Babu, and H. F. Talari, “Just-in-time manufacturing system: from introduction to implement,” International Journal of Economics, Business and Finance, vol. 1, no. 2, pp. 7–25, 2013. View at Publisher · View at Google Scholar
  7. S. Kumar, V. Ranga, R. Chopra, and M. S. Sehrawat, “Scope of JIT management in Indian service industries,” in Proceedings of the International Conference on Intelligent Systems and Networks (ISN '08), Klawad, India, 2008.
  8. S. Singh and D. Garg, “JIT system: concepts, benefits and motivation in Indian industries,” International Journal of Management & Business Studies, vol. 1, no. 1, pp. 26–30, 2011. View at Google Scholar
  9. M. O. Adamu and A. O. Adewumi, “Metaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs,” International Journal of Physical Sciences, vol. 7, no. 10, pp. 1641–1652, 2012. View at Publisher · View at Google Scholar
  10. M. O. Adamu and A. O. Adewumi, “Unweighted parallel machine scheduling: a meta-heuristic approach,” in Proceedings of the International Conference in Electrical and Electronics Engineering, pp. 65–72, Istanbul, Turkey, 2013.
  11. S. Chetty and A. O. Adewumi, “Three new stochastic local search algorithms for continuous optimization problems,” Computational Optimization and Applications, vol. 56, no. 3, pp. 675–721, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. Chetty and A. O. Adewumi, “Three new stochastic local search metaheuristics for the annual crop planning problem based on a new irrigation scheme,” Journal of Applied Mathematics, vol. 2013, Article ID 158538, 14 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Chetty and A. O. Adewumi, “On the performance of new local search heuristics for annual crop planning: case study of the Vaalharts irrigation scheme,” Journal of Experimental & Theoretical Artificial Intelligence, 2014. View at Publisher · View at Google Scholar
  14. D. P. Ronconi and M. S. Kawamura, “The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm,” Computational & Applied Mathematics, vol. 29, no. 2, pp. 107–124, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J.-N. Monette, Y. Deville, and P. van Hentenryck, “Just-in-time scheduling with constraint programming,” in Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS '09), pp. 241–248, Thessaloniki, Greece, September 2009. View at Scopus
  16. D. Dereniowski and W. Kubiak, “Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines,” Journal of Scheduling, vol. 13, no. 5, pp. 479–492, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. G. A. Süer, X. Yang, O. I. Alhawari, J. Santos, and R. Vazquez, “A genetic algorithm approach for minimizing total tardiness in single machine scheduling,” International Journal of Industrial Engineering and Management, vol. 3, no. 3, pp. 163–171, 2012. View at Google Scholar · View at Scopus
  18. P. J. van Laarhoven, E. H. Aarts, and J. K. Lenstra, “Job shop scheduling by simulated annealing,” Operations Research, vol. 40, no. 1, pp. 113–125, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. S. K. Sidhoum, Y. R. Solis, and F. Sourd, Lower Bounds for the Earliness-Tardiness Scheduling Problem on Single and Parallel Machines, Laboratoire d'Informatique de Paris 6 (LIP6), Paris, France, 2004.
  20. P. R. McMullen, “JIT sequencing for mixed-model assembly lines with setups using Tabu Search,” Production Planning & Control, vol. 9, no. 5, pp. 504–510, 1998. View at Publisher · View at Google Scholar · View at Scopus
  21. D. Naso, M. Surico, B. Turchiano, and U. Kaymak, “Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete,” European Journal of Operational Research, vol. 177, no. 3, pp. 2069–2099, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. M. O. Adamu and O. Abass, “Parallel machine scheduling to maximize the weighted number of just-in-time jobs,” Journal of Applied Science and Technology, vol. 15, no. 1-2, pp. 27–34, 2010. View at Publisher · View at Google Scholar
  23. X. S. Yang, Nature-Inspired Metaheuristic Algorithms, Luniver Press, 2nd edition, 2010.
  24. F. Glover, “Tabu search—part I,” ORSA Journal on Computing, vol. 1, no. 2, pp. 190–206, 1989. View at Google Scholar
  25. F. Glover, “Tabu search—part 2,” ORSA Journal on Computing, vol. 2, no. 1, pp. 4–32, 1990. View at Google Scholar
  26. S. Kirkpatrick, J. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  27. C. M. Tan, Simulated Annealing, InTech Publisher, 2008.
  28. A. O. Adewumi and M. M. Ali, “A multi-level genetic algorithm for a multi-stage space allocation problem,” Mathematical and Computer Modelling, vol. 51, no. 1-2, pp. 109–126, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. M. A. Arasomwan and A. O. Adewumi, “An adaptive velocity particle swarm optimization for high-dimensional function optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '13), pp. 2352–2359, Cancún, Mexico, June 2013. View at Publisher · View at Google Scholar · View at Scopus