Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 3630869, 9 pages
https://doi.org/10.1155/2017/3630869
Research Article

Synergy of Genetic Algorithm with Extensive Neighborhood Search for the Permutation Flowshop Scheduling Problem

1Department of Distribution Management, National Taichung University of Science and Technology, Taichung 404, Taiwan
2Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, Taichung 404, Taiwan

Correspondence should be addressed to Chien-Che Huang; moc.liamg@8290selrahc

Received 19 August 2016; Revised 24 December 2016; Accepted 17 January 2017; Published 13 February 2017

Academic Editor: Jean J. Loiseau

Copyright © 2017 Rong-Chang Chen 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. H. Abedinnia, C. H. Glock, and A. Brill, “New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem,” Computers and Operations Research, vol. 74, pp. 165–174, 2016. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. M. Fatih Tasgetiren, Q.-K. Pan, P. N. Suganthan, and O. Buyukdagli, “A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem,” Computers and Operations Research, vol. 40, no. 7, pp. 1729–1743, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. V. Fernandez-Viagas and J. M. Framinan, “On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem,” Computers & Operations Research, vol. 45, pp. 60–67, 2014. View at Publisher · View at Google Scholar · View at Scopus
  4. W. B. Liu, “A hybrid differential evolution algorithm based on dynamic variable neighborhood search for permutation flowshop scheduling problem,” Applied Mechanics and Materials, vol. 835, pp. 847–857, 2016. View at Publisher · View at Google Scholar
  5. B. Naderi and R. Ruiz, “A scatter search algorithm for the distributed permutation flowshop scheduling problem,” European Journal of Operational Research, vol. 239, no. 2, pp. 323–334, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. R. Ruiz and T. Stützle, “A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem,” European Journal of Operational Research, vol. 177, no. 3, pp. 2033–2049, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. D. R. Sule, Industrial Scheduling, PWS Publishing, Boston, Mass, USA, 1996.
  8. M. R. Garey, D. S. Johnson, and R. Sethi, “The complexity of flowshop and jobshop scheduling,” Mathematics of Operations Research, vol. 1, no. 2, pp. 117–129, 1976. View at Publisher · View at Google Scholar · View at Scopus
  9. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: overview and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. N. Krasnogor and J. Smith, “A tutorial for competent memetic algorithms: model, taxonomy, and design issues,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 5, pp. 474–488, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Ruiz, C. Maroto, and J. Alcaraz, “Two new robust genetic algorithms for the flowshop scheduling problem,” Omega, vol. 34, no. 5, pp. 461–476, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. G. I. Zobolas, C. D. Tarantilis, and G. Ioannou, “Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm,” Computers & Operations Research, vol. 36, no. 4, pp. 1249–1267, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. S. M. Johnson, “Optimal two- and three-stage production schedules with setup times included,” Naval Research Logistics Quarterly, vol. 1, no. 1, pp. 61–68, 1954. View at Publisher · View at Google Scholar
  14. 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
  15. R. Ruiz and C. Maroto, “A comprehensive review and evaluation of permutation flowshop heuristics,” European Journal of Operational Research, vol. 165, no. 2, pp. 479–494, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. D. S. Palmer, “Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum,” Journal of the Operational Research Society, vol. 16, no. 1, pp. 101–107, 1965. View at Publisher · View at Google Scholar
  17. H. G. Campbell, R. A. Dudek, and M. L. Smith, “A heuristic algorithm for the n job, m machine sequencing problem,” Management Science, vol. 16, no. 10, pp. B630–B637, 1970. View at Publisher · View at Google Scholar · View at Scopus
  18. D. G. Dannenbring, “An evaluation of flow shop sequencing heuristics,” Management Science, vol. 23, no. 11, pp. 1174–1182, 1977. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  20. E. Taillard, “Some efficient heuristic methods for the flow shop sequencing problem,” European Journal of Operational Research, vol. 47, no. 1, pp. 65–74, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. X. Dong, H. Huang, and P. Chen, “An improved NEH-based heuristic for the permutation flowshop problem,” Computers & Operations Research, vol. 35, no. 12, pp. 3962–3968, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. P. J. Kalczynski and J. Kamburowski, “An improved NEH heuristic to minimize makespan in permutation flow shops,” Computers & Operations Research, vol. 35, no. 9, pp. 3001–3008, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. H. Ishibuchi, S. Misaki, and H. Tanaka, “Modified simulated annealing algorithms for the flow shop sequencing problem,” European Journal of Operational Research, vol. 81, no. 2, pp. 388–398, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. S. Kirkpatrick, C. D. Gelatt Jr., 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 Zentralblatt MATH · View at Scopus
  25. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Publisher · View at Google Scholar · View at Scopus
  26. F. A. Ogbu and D. K. Smith, “The application of the simulated annealing algorithm to the solution of the n/m/Cmaxflowshop problem,” Computers and Operations Research, vol. 17, no. 3, pp. 243–253, 1990. View at Publisher · View at Google Scholar · View at Scopus
  27. I. Osman and C. Potts, “Simulated annealing for permutation flow-shop scheduling,” Omega, vol. 17, no. 6, pp. 551–557, 1989. View at Publisher · View at Google Scholar · View at Scopus
  28. S. H. Zegordi, K. Itoh, and T. Enkawa, “Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge,” European Journal of Operational Research, vol. 85, no. 3, pp. 515–531, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  29. F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers & Operations Research, vol. 13, no. 5, pp. 533–549, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. F. Glover, “Tabu search—part I,” ORSA Journal on Computing, vol. 1, no. 3, pp. 190–206, 1989. View at Publisher · View at Google Scholar
  31. F. Glover, “Tabu search—part II,” ORSA Journal on Computing, vol. 2, no. 1, pp. 4–32, 1990. View at Publisher · View at Google Scholar
  32. J. Grabowski and M. Wodecki, “A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion,” Computers & Operations Research, vol. 31, no. 11, pp. 1891–1909, 2004. View at Publisher · View at Google Scholar · View at Scopus
  33. E. Nowicki and C. Smutnicki, “A fast tabu search algorithm for the permutation flow-shop problem,” European Journal of Operational Research, vol. 91, no. 1, pp. 160–175, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  34. M. Widmer and A. Hertz, “A new heuristic method for the flow shop sequencing problem,” European Journal of Operational Research, vol. 41, no. 2, pp. 186–193, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. P. Hansen and N. Mladenović, “Variable neighborhood search: principles and applications,” European Journal of Operational Research, vol. 130, no. 3, pp. 449–467, 2001. View at Publisher · View at Google Scholar · View at Scopus
  36. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich , USA, 1975. View at MathSciNet
  37. R.-C. Chen and T.-T. Hu, “A decision-making mechanism considering carbon footprint and cost to fulfil orders for multi-site global companies,” International Journal of Shipping and Transport Logistics, vol. 7, no. 3, pp. 295–318, 2015. View at Publisher · View at Google Scholar · View at Scopus
  38. R.-C. Chen and P.-H. Hung, “Multiobjective order assignment optimization in a global multiple-factory environment,” Mathematical Problems in Engineering, vol. 2014, Article ID 673209, 14 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  39. 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 Publisher · View at Google Scholar · View at Scopus
  40. M. Gen, R. Cheng, and L. Lin, Network Models and Optimization: Multi-Objective Genetic Algorithm Approach, Springer, Berlin, Germany, 2008.
  41. T. Murata, H. Ishibuchi, and H. Tanaka, “Genetic algorithms for flowshop scheduling problems,” Computers & Industrial Engineering, vol. 30, no. 4, pp. 1061–1071, 1996. View at Publisher · View at Google Scholar · View at Scopus
  42. E. Taillard, “Benchmarks for basic scheduling problems,” European Journal of Operational Research, vol. 64, no. 2, pp. 278–285, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  43. E. Taillard, “Summary of Best Known Lower and Upper Bounds of Taillard's Instances,” http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html.