Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015, Article ID 548363, 6 pages
http://dx.doi.org/10.1155/2015/548363
Research Article

A Hybrid Algorithm for the Permutation Flowshop Scheduling Problem without Intermediate Buffers

1College of Resources and Civil Engineering, Northeastern University, Shenyang 110819, China
2School of Management, Tianjin Polytechnic University, Tianjin 300387, China
3School of Mechanical Engineering, Shenyang University of Technology, Shenyang 110870, China

Received 29 September 2014; Revised 4 February 2015; Accepted 4 February 2015

Academic Editor: Bixiang Wang

Copyright © 2015 Xiaobo Liu 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 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
  2. J. Grabowski and J. Pempera, “Sequencing of jobs in some production system,” European Journal of Operational Research, vol. 125, no. 3, pp. 535–550, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. N. G. Hall and C. Sriskandarajah, “A survey of machine scheduling problems with blocking and no-wait in process,” Operations Research, vol. 44, no. 3, pp. 510–525, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. S. T. McCormick, M. L. Pinedo, S. Shenker, and B. Wolf, “Sequencing in an assembly line with blocking to minimize cycle time,” Operations Research, vol. 37, no. 6, pp. 925–935, 1989. View at Publisher · View at Google Scholar · View at Scopus
  5. 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
  6. D. P. Ronconi and V. A. Armentano, “Lower bounding schemes for flowshops with blocking in-process,” Journal of the Operational Research Society, vol. 52, no. 11, pp. 1289–1297, 2001. View at Publisher · View at Google Scholar · View at Scopus
  7. 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 · View at Scopus
  8. I. N. K. Abadi, N. G. Hall, and C. Sriskandarajah, “Minimizing cycle time in a blocking flowshop,” Operations Research, vol. 48, no. 1, pp. 177–180, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. B. Jarboui, M. Eddaly, P. Siarry, and A. Rebaï, “An estimation of distribution algorithm for minimizing the makespan in blocking flowshop scheduling problems,” Studies in Computational Intelligence, vol. 230, pp. 151–167, 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. J. J. Liang, Q.-K. Pan, T. J. Chen, and L. Wang, “Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer,” The International Journal of Advanced Manufacturing Technology, vol. 55, no. 5–8, pp. 755–762, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. X. P. Wang and L. X. 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
  12. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers and Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Hansen, N. Mladenović, and J. A. Moreno Pérez, “Variable neighborhood search,” European Journal of Operational Research, vol. 191, no. 3, pp. 593–595, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Glover, “Heuristics for integer programming using surrogate constraints,” Decision Sciences, vol. 8, no. 1, pp. 156–166, 1977. View at Publisher · View at Google Scholar
  15. R. A. Russell and W.-C. Chiang, “Scatter search for the vehicle routing problem with time windows,” European Journal of Operational Research, vol. 169, no. 2, pp. 606–622, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. E. Nowicki and C. Smutnicki, “Some aspects of scatter search in the flow-shop problem,” European Journal of Operational Research, vol. 169, no. 2, pp. 654–666, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. W. Bozejko, J. Grabowski, and M. Wodecki, “Block approach-tabu search algorithm for single machine total weighted tardiness problem,” Computers and Industrial Engineering, vol. 50, no. 1-2, pp. 1–14, 2006. View at Publisher · View at Google Scholar · View at Scopus
  18. 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 Scopus
  19. D. P. Ronconi, “A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking,” Annals of Operations Research, vol. 138, no. 1, pp. 53–65, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus