Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 902950, 8 pages
http://dx.doi.org/10.1155/2014/902950
Research Article

A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems

1School of Information Engineering, Shenyang University, Shenyang 110044, China
2School of Information Science and Technology, Tsinghua University, Beijing 100084, China

Received 4 August 2013; Accepted 5 November 2013; Published 29 January 2014

Academic Editors: S. Berres and W.-C. Lee

Copyright © 2014 Le Zhang and Jinnan Wu. 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. 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
  2. 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 Scopus
  3. J. M. Framinan, R. Leisten, and R. Ruiz-Usano, “Comparison of heuristics for flowtime minimisation in permutation flowshops,” Computers and Operations Research, vol. 32, no. 5, pp. 1237–1254, 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. 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 Google Scholar · View at Scopus
  5. E. F. Stafford, “On the development of a mixed integer linear programming model for the flowshop sequencing problem,” Journal of the Operational Research Society, vol. 39, pp. 1163–1174, 1988. View at Google Scholar
  6. Z. A. Lomnicki, “A branch and bound algorithm for the exact solution of the three machine scheduling problem,” Operational Research Quarterly, vol. 16, pp. 89–100, 1965. View at Google Scholar
  7. A. P. G. Brown and Z. A. Lomnicki, “Some applications of the branch and bound algorithm to the machine scheduling problem,” Operational Research Quarterly, vol. 17, pp. 173–186, 1966. View at Google Scholar
  8. G. B. McMahon and P. G. Burton, “Flowshop scheduling with the branch and bound method,” Operations Research, vol. 15, no. 3, pp. 473–481, 1967. View at Publisher · View at Google Scholar
  9. E. Ignall and L. Schrage, “Application of the branch and bound technique to some flow-shop scheduling problems,” Operations Research, vol. 13, no. 3, pp. 400–412, 1965. View at Publisher · View at Google Scholar
  10. S. P. Bansal, “Minimizing the sum of completion times of n jobs over m machines in a flowshop—a branch and bound approach,” AIIE Transactions, vol. 9, no. 3, pp. 306–311, 1977. View at Publisher · View at Google Scholar
  11. C.-S. Chung, J. Flynn, and O. Kirca, “A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems,” International Journal of Production Economics, vol. 79, no. 3, pp. 185–196, 2002. View at Publisher · View at Google Scholar · View at Scopus
  12. 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. 630–637, 1970. View at Google Scholar · View at Scopus
  13. C. Koulamas, “A new constructive heuristic for the flowshop scheduling problem,” European Journal of Operational Research, vol. 105, no. 1, pp. 66–71, 1998. View at Google Scholar · View at Scopus
  14. D. Palmer, “Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum,” Operational Research Quarterly, vol. 16, no. 1, pp. 101–107, 1965. View at Google Scholar
  15. J. N. D. Gupta, “Heuristic algorithms for multistage flowshop scheduling problem,” AIIE Transactions, vol. 4, no. 1, pp. 11–18, 1972. View at Google Scholar · View at Scopus
  16. T. S. Hundal and J. Rajgopal, “An extension of Palmer’s heuristic for the flow shop scheduling problem,” International Journal of Production Research, vol. 26, no. 6, pp. 1119–1124, 1988. View at Google Scholar · View at Scopus
  17. 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
  18. 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 Google Scholar · View at Scopus
  19. J. Liu and C. R. Reeves, “Constructive and composite heuristic solutions to the P//Ci scheduling problem,” European Journal of Operational Research, vol. 132, no. 2, pp. 439–452, 2001. View at Publisher · View at Google Scholar · View at Scopus
  20. J. M. Framinan and R. Leisten, “An efficient constructive heuristic for flowtime minimisation in permutation flow shops,” Omega, vol. 31, no. 4, pp. 311–317, 2003. View at Publisher · View at Google Scholar · View at Scopus
  21. J. P.-O. Fan and G. K. Winley, “A heuristic search algorithm for flow-shop scheduling,” Informatica, vol. 32, no. 4, pp. 453–464, 2008. View at Google Scholar · View at Scopus
  22. S. M. A. Suliman, “Two-phase heuristic approach to the permutation flow-shop scheduling problem,” International Journal of Production Economics, vol. 64, no. 1, pp. 143–152, 2000. View at Publisher · View at Google Scholar · View at Scopus
  23. J. M. Framinan, M. S. Nagano, and J. V. Moccellin, “An efficient heuristic for total flowtime minimisation in no-wait flowshops,” International Journal of Advanced Manufacturing Technology, vol. 46, no. 9–12, pp. 1049–1057, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. P. C. Chang, W. H. Huang, and J. L. Wu, “A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem,” International Journal of Production Economics, vol. 141, no. 1, pp. 45–55, 2013. View at Publisher · View at Google Scholar
  25. 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
  26. N. Hooda and A. K. Dhingra, “Flow shop scheduling using simulated annealing: a review,” International Journal of Applied Engineering Research, vol. 2, no. 1, pp. 234–249, 2011. View at Google Scholar
  27. B. V. Nouri, P. Fattahi, and R. Ramezanian, “Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities,” International Journal of Production Research, vol. 51, no. 12, pp. 3501–3515, 2013. View at Publisher · View at Google Scholar
  28. J. Gao, R. Chen, and W. Deng, “An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem,” International Journal of Production Research, vol. 51, no. 3, pp. 641–651, 2013. View at Publisher · View at Google Scholar
  29. C. Rajendran and H. Ziegler, “Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs,” European Journal of Operational Research, vol. 155, no. 2, pp. 426–438, 2004. View at Publisher · View at Google Scholar · View at Scopus
  30. 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 Scopus
  31. M. F. Tasgetiren, Y.-C. Liang, M. Sevkli, and G. Gencyilmaz, “A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem,” European Journal of Operational Research, vol. 177, no. 3, pp. 1930–1947, 2007. View at Publisher · View at Google Scholar · View at Scopus
  32. X. Wang and L. Tang, “A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking,” Applied Soft Computing Journal, vol. 12, no. 2, pp. 652–662, 2012. View at Publisher · View at Google Scholar · View at Scopus
  33. E. Taillard, “Benchmarks for basic scheduling problems,” European Journal of Operational Research, vol. 64, no. 2, pp. 278–285, 1993. View at Google Scholar · View at Scopus
  34. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, December 1995. View at Scopus
  35. R. Eberhart and J. Kennedy, “New optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp. 39–43, October 1995. View at Scopus
  36. 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
  37. F. Glover, M. Laguna, and R. Martí, “Fundamentals of scatter search and path relinking,” Control and Cybernetics, vol. 29, no. 3, pp. 652–684, 2000. View at Google Scholar · View at Scopus