Table of Contents
Journal of Industrial Engineering
Volume 2014, Article ID 628640, 10 pages
http://dx.doi.org/10.1155/2014/628640
Research Article

A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm

1Department of Systems Engineering, University of Lagos, Akoka, Yaba 23401, Nigeria
2Department of Mechanical Engineering, Tshwane University of Technology, Pretoria 0001, South Africa

Received 28 August 2013; Revised 17 December 2013; Accepted 18 December 2013; Published 6 April 2014

Academic Editor: Wen-Chiung Lee

Copyright © 2014 Adeyanju Sosimi et al. 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. T. Aldowaisan and A. Allahverdi, “New heuristics for no-wait flowshops to minimize makespan,” Computers and Operations Research, vol. 30, no. 8, pp. 1219–1231, 2003. View at Publisher · View at Google Scholar · View at Scopus
  2. R. Bellman, “Mathematical aspects of scheduling theory,” Journal of the Society for Industrial and Applied Mathematics, vol. 4, no. 3, pp. 168–205, 1956. View at Publisher · View at Google Scholar
  3. M. Y. Wang, S. P. Sethi, and S. L. Van De Velde, “Minimizing makespan in a class of re-entrant shops,” Operations Research, vol. 45, no. 5, pp. 702–712, 1997. View at Publisher · View at Google Scholar
  4. C. H. Campbell, D. R. Dudek, and S. M. Smith, “A heuristic algorithm for n job, m machine sequencing problem,” Management Science, vol. 16, no. 10, pp. 630–637, 1970. View at Google Scholar · View at Scopus
  5. P.-C. Chang, S.-H. Chen, and K.-L. Lin, “Two-phase sub population genetic algorithm for parallel machine-scheduling problem,” Expert Systems with Applications, vol. 29, no. 3, pp. 705–712, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. D. G. Dannenbring, “An evaluation of flow-shop sequencing heuristics,” Management Science, vol. 23, no. 11, pp. 1174–1182, 1977. View at Google Scholar · View at Scopus
  7. C.-L. Chen, V. S. Vempati, and N. Aljaber, “An application of genetic algorithms for flow shop problems,” European Journal of Operational Research, vol. 80, no. 2, pp. 389–396, 1995. View at Google Scholar · View at Scopus
  8. H. D. Pour, “A new heuristic for the n-job, m-machine flow-shop problem,” Production Planning and Control, vol. 12, no. 7, pp. 648–653, 2001. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Dolgui, B. Finel, N. Guschinsky, G. Levin, and F. Vernadat, “MIP approach to balancing transfer lines with blocks of parallel operations,” IIE Transactions, vol. 38, no. 10, pp. 869–882, 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
  11. S. Reza Hejazi and S. Saghafian, “Flowshop-scheduling problems with makespan criterion: a review,” International Journal of Production Research, vol. 43, no. 14, pp. 2895–2929, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. F. Werner, “On the heuristic solution of the permutation flowshop problem by path algorithms,” Computer and Operations Research, vol. 20, no. 7, pp. 707–722, 1993. View at Google Scholar
  13. T. Stutzle, Local search algorithm for combinatorial problems: analysis, improvements, and newapplications [Ph.D. thesis], Darmstadt University of Technology, Department of Computer Science, 1998.
  14. C. Rajendra and H. Ziegler, “Ant colony algorithms for permutationflowshop scheduling to minimize makespan/totalflow-time of jobs,” European Journal of Operational Research, vol. 155, no. 2, pp. 426–438.
  15. J. Grabowski and M. Wodecki, “A very fast tabu search algorithmfor permutation flow shop problem with makespancriterion,” Computers and Operations Research, vol. 31, no. 11, pp. 1891–1909, 2004. View at Google Scholar
  16. R. Ruiz and C. Maroto, “A comprehensive review and evaluationof permutation flowshop heuristics,” European Journal of Operational Research, vol. 165, no. 2, pp. 479–494, 2005. View at Google Scholar
  17. J. Soewande, T. Octavia, and I. H. Sahputra, “Robust hybrid genetic algorithm for a flow-shop scheduling problem (A case study at PT FSCM manufacturing Indonesia),” Jurnal of Teknik Industri, vol. 9, no. 2, pp. 144–151, 2008. View at Google Scholar
  18. M. S. Nagano, R. Ruiz, and L. A. N. Loren, “A constructive genetic algorithm for permutation flow shop scheduling,” Computer and Industrial Engineering, vol. 55, no. 1, pp. 195–207, 2008. View at Google Scholar
  19. R. Ruiz, J. C. Garcia-Diaz, and C. Maroto, “Considering schedulling and preventive maintenance in the flow shop sequencing problem,” Computer and Operations Research, vol. 34, no. 11, pp. 3314–3330, 2007. View at Google Scholar
  20. A. El-Bouri, N. Azizi, and S. A. Zolfaghari, “Comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling,” European Journal of Operational Research, vol. 177, no. 3, pp. 1894–1910, 2007. View at Google Scholar
  21. J. H. Holland, Adaptation in Natural and Artificial Systems: An IntroducTory Analysis with Applications to Biology, Control and Artificial Intelligence, University of Michigan Press, 1975.
  22. J. C.-H. Pan and J.-S. Chen, “Minimizing makespan in re-entrant permutation flow-shops,” Journal of the Operational Research Society, vol. 54, no. 6, pp. 642–653, 2003. View at Publisher · View at Google Scholar · View at Scopus
  23. J. C. H. Pan and J. S. Chen, “A comparative study of schedule-generation procedures for the re-entrant shops,” International Journal of Industrial Engineering, vol. 11, no. 4, pp. 313–321, 2004. View at Google Scholar
  24. M. Pinedo, Scheduling Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ, USA, 2nd edition, 2002.
  25. S. G. Ponnambalam, P. Aravindan, and S. Chandrasekaran, “Constructive and improvement flow shop scheduling heuristics: an extensive evaluation,” Production Planning and Control, vol. 12, no. 4, pp. 335–344, 2001. View at Publisher · View at Google Scholar · View at Scopus