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

Clustering and Genetic Algorithm Based Hybrid Flowshop Scheduling with Multiple Operations

Key Laboratory of Contemporary Design and Integrated Manufacturing Technology, Ministry of Education, Northwestern Polytechnical University, Xi'an 710072, China

Received 6 January 2014; Accepted 19 February 2014; Published 27 March 2014

Academic Editor: Gongnan Xie

Copyright © 2014 Yingfeng Zhang 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. C. Rahendran and D. Chaudhuri, “A multi-stage parallel-processor flowshop problem with minimum flowtime,” European Journal of Operational Research, vol. 57, no. 1, pp. 111–122, 1992. View at Publisher · View at Google Scholar
  2. F. Riane, A. Artiba, and S. E. Elmaghraby, “A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan,” European Journal of Operational Research, vol. 109, no. 2, pp. 321–329, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. R. Linn and W. Zhang, “Hybrid flow shop scheduling: a survey,” Computers and Industrial Engineering, vol. 37, no. 1-2, pp. 57–61, 1999. View at Publisher · View at Google Scholar
  4. C. Oǧuz, Y. Zinder, V. H. Do, A. Janiak, and M. Lichtenstein, “Hybrid flow-shop scheduling problems with multiprocessor task systems,” European Journal of Operational Research, vol. 152, no. 1, pp. 115–131, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. K.-C. Ying and S.-W. Lin, “Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach,” International Journal of Production Research, vol. 44, no. 16, pp. 3161–3177, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. K. Alaykýran, O. Engin, and A. Döyen, “Using ant colony optimization to solve hybrid flow shop scheduling problems,” International Journal of Advanced Manufacturing Technology, vol. 35, no. 5-6, pp. 541–550, 2007. View at Publisher · View at Google Scholar
  7. H. Luo, G. Q. Huang, Y. Zhang, Q. Dai, and X. Chen, “Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm,” Robotics and Computer-Integrated Manufacturing, vol. 25, no. 6, pp. 962–971, 2009. View at Publisher · View at Google Scholar
  8. B. L. Maccarthy and J. Liu, “Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling,” International Journal of Production Research, vol. 31, no. 1, pp. 59–79, 1993. View at Publisher · View at Google Scholar
  9. B. Chen, “Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage,” Journal of the Operational Research Society, vol. 46, no. 2, pp. 234–244, 1995. View at Google Scholar · View at Zentralblatt MATH
  10. L. Wang and D.-Z. Zheng, “An effective hybrid heuristic for flow shop scheduling,” International Journal of Advanced Manufacturing Technology, vol. 21, no. 1, pp. 38–44, 2003. View at Publisher · View at Google Scholar
  11. D. Laha and U. K. Chakraborty, “A constructive heuristic for minimizing makespan in no-wait flow shop scheduling,” International Journal of Advanced Manufacturing Technology, vol. 41, no. 1-2, pp. 97–109, 2009. View at Publisher · View at Google Scholar
  12. A. Rossi, A. Puppato, and M. Lanzetta, “Heuristics for scheduling a two-stage hybrid flowshop 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
  13. C. Y. Cheng, T. L. Chen, L. C. Wang, and Y. Y. Chen, “A genetic algorithm for the multi-stage and parallel-machine scheduling problem with job splitting-A case study for the solar cell industry,” International Journal of Production Research, vol. 51, no. 16, pp. 4755–4777, 2013. View at Publisher · View at Google Scholar
  14. C. Sriskandarajah, “Performance of scheduling algorithms for no-wait flowshops with parallel machines,” European Journal of Operational Research, vol. 70, no. 3, pp. 365–378, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. V. Caraffa, S. Ianes, T. P. Bagchi, and C. Sriskandarajah, “Minimizing makespan in a blocking flowshop using genetic algorithms,” International Journal of Production Economics, vol. 70, no. 2, pp. 101–115, 2001. View at Publisher · View at Google Scholar
  16. R. Ruiz and A. Allahverdi, “No-wait flowshop with separate setup times to minimize maximum lateness,” International Journal of Advanced Manufacturing Technology, vol. 35, no. 5-6, pp. 551–565, 2007. View at Publisher · View at Google Scholar
  17. B. Liu, L. Wang, and Y.-H. Jin, “An effective hybrid particle swarm optimization for no-wait flow shop scheduling,” International Journal of Advanced Manufacturing Technology, vol. 31, no. 9-10, pp. 1001–1011, 2007. View at Publisher · View at Google Scholar
  18. A. Mascis and D. Pacciarelli, “Job-shop scheduling with blocking and no-wait constraints,” European Journal of Operational Research, vol. 143, no. 3, pp. 498–517, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. H. Luo, G. Q. Huang, Y. Feng Zhang, and Q. Yun Dai, “Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows,” International Journal of Production Research, vol. 49, no. 6, pp. 1575–1603, 2011. View at Publisher · View at Google Scholar