Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 420308, 10 pages
http://dx.doi.org/10.1155/2015/420308
Research Article

Efficient Heuristic Algorithm for Scheduling Two-Stage Hybrid Flowshop with Sequence-Dependent Setup Times

1College of Business Administration, Konkuk University, 120 Neungdong-ro, Gwangjin-gu, Seoul 143-701, Republic of Korea
2LG CNS, FKI Tower, 24 Yeoui-daero, Yeongdeungpo-gu, Seoul 150-881, Republic of Korea
3Department of Management Engineering, Sangmyung University, 31 Sangmyungdae-gil, Dongnam-gu, Cheonan, Chungnam 330-720, Republic of Korea

Received 29 January 2015; Revised 30 April 2015; Accepted 30 April 2015

Academic Editor: Yunqiang Yin

Copyright © 2015 Geun-Cheol Lee 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. R. Ruiz and J. A. Vázquez-Rodríguez, “The hybrid flow shop scheduling problem,” European Journal of Operational Research, vol. 205, no. 1, pp. 1–18, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. H. S. Mirsanei, M. Zandieh, M. J. Moayed, and M. R. Khabbazi, “A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times,” Journal of Intelligent Manufacturing, vol. 22, no. 6, pp. 965–978, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. H.-T. Lin and C.-J. Liao, “A case study in a two-stage hybrid flow shop with setup time and dedicated machines,” International Journal of Production Economics, vol. 86, no. 2, pp. 133–143, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Rossi, A. Puppato, and M. Lanzetta, “Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: application at a hospital sterilisation plant,” International Journal of Production Research, vol. 51, no. 8, pp. 2363–2376, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. J. N. D. Gupta, “Two-stage, hybrid flowshop scheduling problem,” Journal of the Operational Research Society, vol. 39, no. 4, pp. 359–364, 1988. View at Publisher · View at Google Scholar · View at Scopus
  6. M. E. Kurz and R. G. Askin, “Scheduling flexible flow lines with sequence-dependent setup times,” European Journal of Operational Research, vol. 159, no. 1, pp. 66–82, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. M. Zandieh, S. M. Fatemi Ghomi, and S. M. Moattar Husseini, “An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times,” Applied Mathematics and Computation, vol. 180, no. 1, pp. 111–127, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. B. Naderi, M. Zandieh, and V. Roshanaei, “Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness,” International Journal of Advanced Manufacturing Technology, vol. 41, no. 11-12, pp. 1186–1198, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. T.-H. Park, H.-J. Kim, and N. Kim, “Path planning of automated optical inspection machines for PCB assembly systems,” International Journal of Control, Automation and Systems, vol. 4, no. 1, pp. 96–104, 2006. View at Google Scholar · View at Scopus
  10. X. Zhu and W. E. Wilhelm, “Scheduling and lot sizing with sequence-dependent setup: a literature review,” IIE Transactions, vol. 38, no. 11, pp. 987–1007, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. P. S. Ow and T. E. Morton, “Filtered beam search in scheduling,” International Journal of Production Research, vol. 26, no. 1, pp. 35–62, 1988. View at Publisher · View at Google Scholar · View at Scopus
  12. 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
  13. G.-C. Lee, S. Choi, D. Hong, and S.-H. Choi, “Heuristic algorithms for the path planning problem in three-dimensional automated optical inspection (AOI) machines,” International Journal of Control and Automation, vol. 6, no. 4, pp. 321–328, 2013. View at Google Scholar · View at Scopus
  14. 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
  15. T. C. E. Cheng and B. M. T. Lin, “Johnson's rule, composite jobs and the relocation problem,” European Journal of Operational Research, vol. 192, no. 3, pp. 1008–1013, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. Q.-K. Pan, L. Wang, and B.-H. Zhao, “An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion,” International Journal of Advanced Manufacturing Technology, vol. 38, no. 7-8, pp. 778–786, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. 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
  18. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, “Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning,” Operations Research, vol. 37, no. 6, pp. 865–892, 1989. View at Publisher · View at Google Scholar · View at Scopus