Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 2857564, 20 pages
https://doi.org/10.1155/2017/2857564
Research Article

A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem

Engineering Research Center of IoT Technology Applications, Ministry of Education, Jiangnan University, Wuxi 214122, China

Correspondence should be addressed to Yan Wang

Received 12 May 2017; Revised 1 November 2017; Accepted 9 November 2017; Published 29 November 2017

Academic Editor: Josefa Mula

Copyright © 2017 Chun 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. 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 Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. M. Mastrolilli and L. M. Gambardella, “Effective neighbourhood functions for the flexible job shop problem,” Journal of Scheduling, vol. 3, no. 1, pp. 3–20, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. G. Zhang, L. Gao, and Y. Shi, “An effective genetic algorithm for the flexible job-shop scheduling problem,” Expert Systems with Applications, vol. 38, no. 4, pp. 3563–3573, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. 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
  5. Y. Yuan and H. Xu, “An integrated search heuristic for large-scale flexible job shop scheduling problems,” Computers & Operations Research, vol. 40, no. 12, pp. 2864–2877, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. Q. Zhang and H. Li, “MOEA/D: a multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 6, pp. 712–731, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. H. Li and Q. Zhang, “Multi-objective optimization problems with complicated pareto sets, MOEA/D and NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 284–302, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. Q. Zhang, W. Liu, E. Tsang, and B. Virginas, “Expensive multiobjective optimization by MOEA/D with gaussian process model,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 3, pp. 456–474, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. Y.-Y. Tan, Y.-C. Jiao, H. Li, and X.-K. Wang, “A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets,” Information Sciences, vol. 213, pp. 14–38, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  11. Y. Yuan, H. Xu, B. Wang, B. Zhang, and X. Yao, “A new dominance relation-based evolutionary algorithm for many-objective optimization,” IEEE Transactons on Evolutionary Computation, vol. 20, no. 1, pp. 16–37, 2016. View at Google Scholar
  12. Y. Yuan, H. Xu, B. Wang, B. Zhang, and X. Yao, “Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers,” IEEE Transactions on Evolutionary Computation, vol. 20, no. 2, pp. 180–198, 2016. View at Publisher · View at Google Scholar · View at Scopus
  13. P. C. Chang, S. H. Chen, Q. Zhang, and J. L. Lin, “MOEA/D for flowshop scheduling problems,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '08), pp. 1433–1438, Hong Kong, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Alhindi and Q. Zhang, “MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems,” in Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, pp. 1155–1164, China, July 2014. View at Publisher · View at Google Scholar · View at Scopus
  15. X.-N. Shen, Y. Han, and J.-Z. Fu, “Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems,” Soft Computing, pp. 1–24, 2016. View at Publisher · View at Google Scholar · View at Scopus
  16. F. Zhao, Z. Chen, J. Wang, and C. Zhang, “An improved MOEA/D for multi-objective job shop scheduling problem,” International Journal of Computer Integrated Manufacturing, vol. 30, no. 6, pp. 616–640, 2017. View at Publisher · View at Google Scholar · View at Scopus
  17. W. Xia and Z. Wu, “An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems,” Computers & Industrial Engineering, vol. 48, no. 2, pp. 409–425, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. J. Gao, M. Gen, L. Sun, and X. Zhao, “A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems,” Computers & Industrial Engineering, vol. 53, no. 1, pp. 149–162, 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. G. H. Zhang, X. Y. Shao, P. G. 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
  20. L.-N. Xing, Y.-W. Chen, and K.-W. Yang, “An efficient search method for multi-objective flexible job shop scheduling problems,” Journal of Intelligent Manufacturing, vol. 20, no. 3, pp. 283–293, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. J.-Q. Li, Q.-K. Pan, and Y.-C. Liang, “An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 647–662, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. S. Wang, L. Wang, M. Liu, and Y. Xu, “An estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem,” in Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Scheduling, CISched 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, pp. 1–8, Singapore, April 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. I. Kacem, S. Hammadi, and P. Borne, “Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic,” Mathematics and Computers in Simulation, vol. 60, no. 3-5, pp. 245–276, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. N. B. Ho and J. C. Tay, “Solving multiple-objective flexible job shop problems by evolution and local search,” IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 38, no. 5, pp. 674–685, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. X. Wang, L. Gao, C. Zhang, and X. Shao, “A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 51, no. 5-8, pp. 757–767, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. M. Frutos, A. C. Olivera, and F. Tohm, “A memetic algorithm based on a {NSGAII} scheme for the flexible job-shop scheduling problem,” Annals of Operations Research, vol. 181, pp. 745–765, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  27. Y. Yuan and H. Xu, “Multiobjective flexible job shop scheduling using memetic algorithms,” IEEE Transactions on Automation Science and Engineering, vol. 12, no. 1, pp. 336–353, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. J.-Q. Li, Q.-K. Pan, and J. Chen, “A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems,” International Journal of Production Research, vol. 50, no. 4, pp. 1063–1078, 2012. View at Publisher · View at Google Scholar · View at Scopus
  29. 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
  30. J. Xiong, X. Tan, K. Yang, L. Xing, and Y. Chen, “A Hybrid Multiobjective Evolutionary Approach for Flexible Job-Shop Scheduling Problems,” Mathematical Problems in Engineering, vol. 2012, pp. 1–27, 2012. View at Publisher · View at Google Scholar
  31. L. Wang, S. Y. 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
  32. S. Jia and Z.-H. Hu, “Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem,” Computers & Operations Research, vol. 47, pp. 11–26, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. G. Moslehi and M. Mahnam, “A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search,” International Journal of Production Economics, vol. 129, no. 1, pp. 14–22, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. X. Shao, W. Liu, Q. Liu, and C. Zhang, “Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 67, no. 9–12, pp. 2885–2901, 2013. View at Publisher · View at Google Scholar · View at Scopus
  35. L. C. F. Carvalho and M. A. Fernandes, “Multi-objective Flexible Job-Shop scheduling problem with DIPSO: More diversity, greater efficiency,” in Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, pp. 282–289, China, July 2014. View at Publisher · View at Google Scholar · View at Scopus
  36. N. Tian and Z. Ji, “Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization,” Mathematical Problems in Engineering, vol. 2015, Article ID 940592, 10 pages, 2015. View at Publisher · View at Google Scholar · View at Scopus
  37. 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 MathSciNet · View at Scopus
  38. 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
  39. Q. Zhang, H. Li, D. Maringer, and E. Tsang, “MOEA/D with NBI-style Tchebycheff approach for portfolio management,” in Proceedings of the 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, Spain, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  40. Y. Mei, K. Tang, and X. Yao, “Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 2, pp. 151–165, 2011. View at Publisher · View at Google Scholar · View at Scopus
  41. V. A. Shim, K. C. Tan, and C. Y. Cheong, “A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem,” IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 42, no. 5, pp. 682–691, 2012. View at Publisher · View at Google Scholar · View at Scopus
  42. L. Ke and Q. Zhang, “Multiobjective combinatorial optimization by using decomposition and ant colony,” IEEE Transactions on Cybernetics, vol. 43, no. 6, pp. 1845–1859, 2013. View at Google Scholar
  43. L. Ke and Q. Zhang, “Hybridzation of Decomposition and Local Search for Multiobjective Optimization,” IEEE Transactions on Cybernetics, vol. 44, no. 44, pp. 1808–1819, 2014. View at Google Scholar
  44. 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
  45. K. Deb and H. Jain, “An evolutionary many-objective optimization algorithm using reference-point- based nondominated sorting approach, part I: solving problems with box constraints,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 4, pp. 577–601, 2014. View at Publisher · View at Google Scholar
  46. S.-K. Zhao, S.-L. Fang, and X.-J. Gu, “Machine selection and FJSP solution based on limit scheduling completion time minimization,” Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, vol. 20, no. 4, pp. 854–865, 2014. View at Publisher · View at Google Scholar · View at Scopus
  47. F. Pezzella, G. Morganti, and G. Ciaschetti, “A genetic algorithm for the flexible job-shop scheduling problem,” Computers & Operations Research, vol. 35, no. 10, pp. 3202–3212, 2008. View at Publisher · View at Google Scholar · View at Scopus
  48. K. Z. Gao, P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai, and C. S. Chong, “Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling,” Information Sciences, vol. 289, pp. 76–90, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  49. 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 Scopus
  50. E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. Da Fonseca, “Performance assessment of multiobjective optimizers: an analysis and review,” IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 117–132, 2003. View at Publisher · View at Google Scholar · View at Scopus
  51. E. Zitzler and L. Thiele, “Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 257–271, 1999. View at Publisher · View at Google Scholar · View at Scopus
  52. J. Demsar, “Statistical comparisons of classifiers over multiple data sets,” Journal of Machine Learning Research, vol. 7, pp. 1–30, 2006. View at Google Scholar · View at MathSciNet
  53. S. Dauzère-Pérès and J. Paulli, “An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search,” Annals of Operations Research, vol. 70, pp. 281–306, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  54. J. Bader and E. Zitzler, “HypE: an algorithm for fast hypervolume-based many-objective optimization,” Evolutionary Computation, vol. 19, no. 1, pp. 45–76, 2011. View at Publisher · View at Google Scholar · View at Scopus