Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2017, Article ID 9016303, 11 pages
https://doi.org/10.1155/2017/9016303
Research Article

Flexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization

School of Mechanical and Automotive Engineering, Anhui Polytechnic University, Wuhu 241000, China

Correspondence should be addressed to Lei Wang; moc.621@0002ieladgnaw

Received 27 May 2016; Revised 31 October 2016; Accepted 24 November 2016; Published 26 January 2017

Academic Editor: Fabrizio Riguzzi

Copyright © 2017 Lei Wang 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. V. Kaplanoğlu, “An object-oriented approach for multi-objective flexible job-shop scheduling problem,” Expert Systems with Applications, vol. 45, pp. 71–84, 2016. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Gen and L. Lin, “Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey,” Journal of Intelligent Manufacturing, vol. 25, no. 5, pp. 849–866, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. J. Li, Q. Pan, and S. Xie, “An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems,” Applied Mathematics and Computation, vol. 218, no. 18, pp. 9353–9371, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. J.-J. Wang and Y.-J. Liu, “Single-machine bicriterion group scheduling with deteriorating setup times and job processing times,” Applied Mathematics and Computation, vol. 242, pp. 309–314, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. L. Wang, S. Wang, and M. Liu, “A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem,” International Journal of Production Research, vol. 51, no. 12, pp. 3574–3592, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Wang, G. Zhou, Y. Xu, and M. Liu, “An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling,” The International Journal of Advanced Manufacturing Technology, vol. 60, no. 9–12, pp. 1111–1123, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. L. J. Zeballos, “A constraint programming approach to tool allocation and production scheduling in flexible manufacturing systems,” Robotics and Computer-Integrated Manufacturing, vol. 26, no. 6, pp. 725–743, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. I. Driss, K. N. Mouss, and A. Laggoun, “A new genetic algorithm for flexible job-shop scheduling problems,” Journal of Mechanical Science and Technology, vol. 29, no. 3, pp. 1273–1281, 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. X. L. Wu and S. M. Wu, “An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem,” Journal of Intelligent Manufacturing, vol. 26, no. 2, pp. 1–7, 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. K. Z. Gao, P. N. Suganthan, T. J. Chua, C. S. Chong, T. X. Cai, and Q. K. Pan, “A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion,” Expert Systems with Applications, vol. 42, no. 21, pp. 7652–7663, 2015. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Brandimarte, “Routing and scheduling in a flexible job shop by tabu search,” Annals of Operations Research, vol. 41, no. 3, pp. 157–183, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. P. Brucker and R. Schlie, “Job-shop scheduling with multi-purpose machines,” Computing, vol. 45, no. 4, pp. 369–375, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J.-Q. Li, Q.-K. Pan, P. N. Suganthan, and T. J. Chua, “A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 52, no. 5–8, pp. 683–697, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Jamili, M. A. Shafia, and R. Tavakkoli-Moghaddam, “A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 54, no. 1–4, pp. 309–322, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Gao, L. Sun, and M. Gen, “A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems,” Computers and Operations Research, vol. 35, no. 9, pp. 2892–2907, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. N. Al-Hinai and T. Y. Elmekkawy, “Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm,” International Journal of Production Economics, vol. 132, no. 2, pp. 279–291, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. G. Zhang, X. Shao, P. Li, and L. Gao, “An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1309–1318, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. W. Teekeng, A. Thammano, P. Unkaw, and J. Kiatwuthiamorn, “A new algorithm for flexible job-shop scheduling problem based on particle swarm optimization,” Artificial Life and Robotics, vol. 21, no. 1, pp. 1–6, 2016. View at Publisher · View at Google Scholar · View at Scopus
  19. L. N. Xing, Y. W. Chen, P. Wang, Q. S. Zhao, and J. Xiong, “A knowledge-based ant colony optimization for flexible job shop scheduling problems,” Applied Soft Computing, vol. 10, no. 3, pp. 888–896, 2010. View at Google Scholar
  20. J.-Q. Li, Q.-K. Pan, and M. F. Tasgetiren, “A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 38, no. 3, pp. 1111–1132, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. P. Korytkowski, S. Rymaszewski, and T. Wiåniewski, “Ant colony optimization for job shop scheduling using multi-attribute dispatching rules,” The International Journal of Advanced Manufacturing Technology, vol. 67, no. 1–4, pp. 231–241, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. M.-S. Lu and R. Romanowski, “Multi-contextual ant colony optimization of intermediate dynamic job shop problems,” The International Journal of Advanced Manufacturing Technology, vol. 60, no. 5–8, pp. 667–681, 2012. View at Publisher · View at Google Scholar · View at Scopus
  23. C.-J. Liao, Y.-L. Tsai, and C.-W. Chao, “An ant colony optimization algorithm for setup coordination in a two-stage production system,” Applied Soft Computing, vol. 11, no. 8, pp. 4521–4529, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. W. Qin, J. Zhang, and D. Song, “An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time,” Journal of Intelligent Manufacturing, pp. 1–14, 2015. View at Publisher · View at Google Scholar · View at Scopus
  25. R.-H. Huang, C.-L. Yang, and W.-C. Cheng, “Flexible job shop scheduling with due window—a two-pheromone ant colony approach,” International Journal of Production Economics, vol. 141, no. 2, pp. 685–697, 2013. View at Publisher · View at Google Scholar · View at Scopus
  26. K.-L. Huang and C.-J. Liao, “Ant colony optimization combined with taboo search for the job shop scheduling problem,” Computers and Operations Research, vol. 35, no. 4, pp. 1030–1046, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  27. B. Zhao, J. Gao, K. Chen, and K. Guo, “Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines,” Journal of Intelligent Manufacturing, vol. 26, no. 3, pp. 1–16, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. J.-P. Arnaout, R. Musa, and G. Rabadi, “A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines—Part II: enhancements and experimentations,” Journal of Intelligent Manufacturing, vol. 25, no. 1, pp. 43–53, 2014. View at Publisher · View at Google Scholar · View at Scopus
  29. C. W. Leung, T. N. Wong, K. L. Mak, and R. Y. K. Fung, “Integrated process planning and scheduling by an agent-based ant colony optimization,” Computers and Industrial Engineering, vol. 59, no. 1, pp. 166–180, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. X. Li and L. Gao, “An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem,” International Journal of Production Economics, vol. 174, pp. 93–110, 2016. View at Publisher · View at Google Scholar · View at Scopus
  31. L. Sun, L. Lin, Y. Wang, M. Gen, and H. Kawakami, “A Bayesian optimization-based evolutionary algorithm for flexible job shop scheduling,” Procedia Computer Science, vol. 61, pp. 521–526, 2015. View at Publisher · View at Google Scholar
  32. M. Mirabi, “Ant colony optimization technique for the sequence-dependent flowshop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 55, no. 1–4, pp. 317–326, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. C. Blum, “Ant colony optimization: introduction and recent trends,” Physics of Life Reviews, vol. 2, no. 4, pp. 353–373, 2005. View at Publisher · View at Google Scholar · View at Scopus
  34. Q. Ding, X. Hu, L. Sun, and Y. Wang, “An improved ant colony optimization and its application to vehicle routing problem with time windows,” Neurocomputing, vol. 98, pp. 101–107, 2012. View at Publisher · View at Google Scholar · View at Scopus
  35. P. Surekha and S. Sumathi, “Solving fuzzy based job shop scheduling problems using GA and ACO,” Journal of Emerging Trends in Computing and Information Sciences, vol. 1, no. 2, pp. 95–102, 2010. View at Google Scholar
  36. T. Stützle and H. H. Hoos, “MAX-MIN ant system,” Future Generation Computer Systems, vol. 16, no. 8, pp. 889–914, 2000. View at Publisher · View at Google Scholar · View at Scopus
  37. I. Kacem, S. Hammadi, and P. Borne, “Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 32, no. 1, pp. 1–13, 2002. View at Publisher · View at Google Scholar · View at Scopus
  38. M. Yazdani, M. Amiri, and M. Zandieh, “Flexible job-shop scheduling with parallel variable neighborhood search algorithm,” Expert Systems with Applications, vol. 37, no. 1, pp. 678–687, 2010. View at Publisher · View at Google Scholar · View at Scopus
  39. L. Wang, S. Wang, Y. Xu, G. Zhou, and M. Liu, “A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem,” Computers & Industrial Engineering, vol. 62, no. 4, pp. 917–926, 2012. View at Publisher · View at Google Scholar · View at Scopus
  40. J.-Q. Li, Q.-K. Pan, and K.-Z. Gao, “Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems,” The International Journal of Advanced Manufacturing Technology, vol. 55, no. 9, pp. 1159–1169, 2011. View at Publisher · View at Google Scholar · View at Scopus
  41. T.-C. Chiang and H.-J. Lin, “A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling,” International Journal of Production Economics, vol. 141, no. 1, pp. 87–98, 2013. View at Publisher · View at Google Scholar · View at Scopus
  42. N. B. Ho, J. C. Tay, and E. M.-K. Lai, “An effective architecture for learning and evolving flexible job-shop schedules,” European Journal of Operational Research, vol. 179, no. 2, pp. 316–333, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  43. F. Pezzella, G. Morganti, and G. Ciaschetti, “A genetic algorithm for the flexible job-shop scheduling problem,” Computers and Operations Research, vol. 35, no. 10, pp. 3202–3212, 2008. View at Publisher · View at Google Scholar · View at Scopus