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

An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers

School of Information and Electrical Engineering, Ludong University, Yantai 264025, China

Received 25 January 2016; Accepted 18 May 2016

Academic Editor: Vladimir Turetsky

Copyright © 2016 Guanlong Deng 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. W. Thornton and J. L. Hunsucker, “A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage,” European Journal of Operational Research, vol. 152, no. 1, pp. 96–114, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. I. Ribas, R. Companys, and X. Tort-Martorell, “An iterated greedy algorithm for the flowshop scheduling problem with blocking,” Omega, vol. 39, no. 3, pp. 293–301, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. Q.-K. Pan and L. Wang, “Effective heuristics for the blocking flowshop scheduling problem with makespan minimization,” Omega, vol. 40, no. 2, pp. 218–229, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. C. H. Papadimitriou and P. C. Kanellakis, “Flowshop scheduling with limited temporary storage,” Journal of the ACM, vol. 27, no. 3, pp. 533–549, 1980. View at Publisher · View at Google Scholar
  6. 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 Zentralblatt MATH · View at Scopus
  7. R. Leisten, “Flowshop sequencing problems with limited buffer storage,” International Journal of Production Research, vol. 28, no. 11, pp. 2085–2100, 1990. View at Publisher · View at Google Scholar
  8. 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
  9. D. P. Ronconi, “A note on constructive heuristics for the flowshop problem with blocking,” International Journal of Production Economics, vol. 87, no. 1, pp. 39–48, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. 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
  11. J. Grabowski and J. Pempera, “The permutation flow shop problem with blocking. A tabu search approach,” Omega, vol. 35, no. 3, pp. 302–311, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Wang, Q.-K. Pan, P. N. Suganthan, W.-H. Wang, and Y.-M. Wang, “A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems,” Computers & Operations Research, vol. 37, no. 3, pp. 509–520, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. I. Ribas, R. Companys, and X. Tort-Martorell, “A competitive variable neighbourhood search algorithm for the blocking flow shop problem,” European Journal of Industrial Engineering, vol. 7, no. 6, pp. 729–754, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. L. Wang, Q.-K. Pan, and M. F. Tasgetiren, “A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem,” Computers & Industrial Engineering, vol. 61, no. 1, pp. 76–83, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. L. Wang, Q.-K. Pan, and M. F. Tasgetiren, “Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms,” Expert Systems with Applications, vol. 37, no. 12, pp. 7929–7936, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. G. Deng, Z. Xu, and X. Gu, “A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling,” Chinese Journal of Chemical Engineering, vol. 20, no. 6, pp. 1067–1073, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. C. Smutnicki, “A two-machine permutation flow shop scheduling problem with buffers,” Operations-Research-Spektrum, vol. 20, no. 4, pp. 229–235, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  18. E. Nowicki, “The permutation flow shop with buffers: a tabu search approach,” European Journal of Operational Research, vol. 116, no. 1, pp. 205–219, 1999. View at Publisher · View at Google Scholar · View at Scopus
  19. P. Brucker, S. Heitmann, and J. Hurink, “Flow-shop problems with intermediate buffers,” OR Spectrum, vol. 25, no. 4, pp. 549–574, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  20. L. Wang, L. Zhang, and D.-Z. Zheng, “An effective hybrid genetic algorithm for flow shop scheduling with limited buffers,” Computers & Operations Research, vol. 33, no. 10, pp. 2960–2971, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. B. Liu, L. Wang, and Y.-H. Jin, “An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers,” Computers & Operations Research, vol. 35, no. 9, pp. 2791–2806, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. B. Qian, L. Wang, D. X. Huang, and X. Wang, “An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers,” International Journal of Production Research, vol. 47, no. 1, pp. 1–24, 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. Y.-C. Hsieh, P.-S. You, and C.-D. Liou, “A note of using effective immune based approach for the flow shop scheduling with buffers,” Applied Mathematics and Computation, vol. 215, no. 5, pp. 1984–1989, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. Q.-K. Pan, L. Wang, and L. Gao, “A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers,” Applied Soft Computing Journal, vol. 11, no. 8, pp. 5270–5280, 2011. View at Publisher · View at Google Scholar · View at Scopus
  25. Q.-K. Pan, L. Wang, L. Gao, and W. D. Li, “An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers,” Information Sciences, vol. 181, no. 3, pp. 668–685, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. F. Q. Zhao, J. X. Tang, J. B. Wang, and J. Jonrinaldi, “An improved particle swarm optimisation with a linearly decreasing disturbance term for flow shop scheduling with limited buffers,” International Journal of Computer Integrated Manufacturing, vol. 27, no. 5, pp. 488–499, 2014. View at Publisher · View at Google Scholar · View at Scopus
  27. G. Moslehi and D. Khorasanian, “A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion,” Computers & Operations Research, vol. 52, pp. 260–268, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. C. Y. Zhang, P. G. Li, Y. Q. Rao, and Z. L. Guan, “A very fast TS/SA algorithm for the job shop scheduling problem,” Computers & Operations Research, vol. 35, no. 1, pp. 282–294, 2008. View at Publisher · View at Google Scholar
  29. C. Y. Zhang, P. Li, Z. Guan, and Y. Rao, “A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem,” Computers & Operations Research, vol. 34, no. 11, pp. 3229–3242, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm,” Journal of Global Optimization, vol. 39, no. 3, pp. 459–471, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. D. Karaboga and B. Basturk, “On the performance of artificial bee colony (ABC) algorithm,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 687–697, 2008. View at Publisher · View at Google Scholar · View at Scopus
  32. N. Karaboga, “A new design method based on artificial bee colony algorithm for digital IIR filters,” Journal of the Franklin Institute, vol. 346, no. 4, pp. 328–348, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. D. Karaboga and B. Akay, “A comparative study of artificial Bee colony algorithm,” Applied Mathematics and Computation, vol. 214, no. 1, pp. 108–132, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. Q.-K. Pan, M. F. Tasgetiren, P. N. Suganthan, and T. J. Chua, “A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem,” Information Sciences, vol. 181, no. 12, pp. 2455–2468, 2011. View at Publisher · View at Google Scholar · View at Scopus
  35. M. F. Tasgetiren, Q.-K. Pan, P. N. Suganthan, and A. H.-L. Chen, “A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops,” Information Sciences, vol. 181, no. 16, pp. 3459–3475, 2011. View at Publisher · View at Google Scholar · View at Scopus
  36. 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
  37. J. M. Framinan and R. Leisten, “Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm,” International Journal of Production Research, vol. 46, no. 22, pp. 6479–6498, 2008. View at Publisher · View at Google Scholar · View at Scopus
  38. E. Vallada and R. Ruiz, “Cooperative metaheuristics for the permutation flowshop scheduling problem,” European Journal of Operational Research, vol. 193, no. 2, pp. 365–376, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  39. Q.-K. Pan, M. F. Tasgetiren, and Y.-C. Liang, “A discrete differential evolution algorithm for the permutation flowshop scheduling problem,” Computers and Industrial Engineering, vol. 55, no. 4, pp. 795–816, 2008. View at Publisher · View at Google Scholar · View at Scopus
  40. G. Deng and X. Gu, “A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion,” Computers & Operations Research, vol. 39, no. 9, pp. 2152–2160, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. Q.-K. Pan and R. Ruiz, “An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem,” Omega, vol. 44, pp. 41–50, 2014. View at Publisher · View at Google Scholar · View at Scopus
  42. D. C. Montgomery, Design and Analysis of Experiments, Wiley, New York, NY, USA, 8th edition, 2012.