Advertisement

A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem

  • Guohui Zhang
  • Lingjie Zhang
  • Xiaohui Song
  • Yongcheng Wang
  • Chi Zhou
Article

Abstract

Production scheduling problems are typically combinational optimization problems named bases on the processing routes of jobs on different machines. In this paper, the flexible job shop scheduling problem aimed to minimize the maximum completion times of operations or makespan is considered. To solve such an NP-hard problem, variable neighborhood search (VNS) based on genetic algorithm is proposed to enhance the search ability and to balance the intensification and diversification. VNS algorithm has shown excellent capability of local search with systematic neighborhood search structures. External library is improved to save the optimal or near optimal solutions during the iterative process, and when the objective value of the optimal solutions are the same, the scheduling Gantt charts need to be considered. To evaluate the performance of our proposed algorithm, benchmark instances in different sizes are optimized. Consequently, the computational results and comparisons illustrate that the proposed algorithm is efficiency and effectiveness.

Keywords

Variable neighborhood search Genetic algorithm Flexible job shop scheduling problem External library Makespan 

Notes

Acknowledgements

This paper presents work funded by the National Natural Science Foundation of China (No. 61203179), the Program for Science & Technology Innovation Talents in Universities of Henan Province (No. 14HASTIT006), Foundation for University Key Teacher of Henan Province (No. 2014GGJS-105, 2014GGJS-198), the Aviation Science Funds (No. 2014ZG55016), and Key scientific research projects of Henan Province(No. 16A460025). Also, we would like to thank the Collaborative Innovation Center for Aviation Economy Development.

References

  1. 1.
    Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38(4), 3563–3573 (2011)CrossRefGoogle Scholar
  3. 3.
    Nouri, H.E., Driss, O.B., Ghédira, K.: Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model. J. Ind. Eng. Int. 1(1), 1–14 (2017)Google Scholar
  4. 4.
    Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 48, 409–25 (2005)CrossRefGoogle Scholar
  5. 5.
    Lu, C., Li, X., Gao, L., et al.: An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Comput. Ind. Eng. 2017(104), 156–174 (2017)CrossRefGoogle Scholar
  6. 6.
    Sun, L., Lin, L., Wang, Y., et al.: A bayesian optimization-based evolutionary algorithm for flexible job shop scheduling. Proced. Comput. Sci. 61, 521–526 (2015)CrossRefGoogle Scholar
  7. 7.
    Yuan, Y., Xu, H., Yang, J.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13(7), 3259–3272 (2013)CrossRefGoogle Scholar
  8. 8.
    Yuan, Y., Xu, H.: Flexible job shop scheduling using hybrid differential evolution algorithms. Comput. Ind. Eng. 65(2), 246–260 (2013)CrossRefGoogle Scholar
  9. 9.
    Yuan, Y., Xu, H.: An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput. Oper. Res. 40(12), 2864–2877 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Wang, L., Zhou, G., Xu, Y., et al.: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. 60(1–4), 303–315 (2012)CrossRefGoogle Scholar
  11. 11.
    Karimi, S., Ardalan, Z., Naderi, B., et al.: Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm. Appl. Math. Model. 41, 667–682 (2017)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93–110 (2016)CrossRefGoogle Scholar
  13. 13.
    Ziaee, M.: A heuristic algorithm for the distributed and flexible job-shop scheduling problem. J. Supercomput. 67(1), 69–83 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892–2907 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Amiri, M., Zandieh, M., Yazdani, M., et al.: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem. Int. J. Prod. Res. 48(19), 5671–5689 (2010)CrossRefzbMATHGoogle Scholar
  16. 16.
    Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Adibi, M.A., Shahrabi, J.: A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem. Int. J. Adv. Manuf. Technol. 70(9–12), 1955–1961 (2014)CrossRefGoogle Scholar
  18. 18.
    Jarboui, B., Derbel, H., Hanafi, S., et al.: Variable neighborhood search for location routing. Comput. Oper. Res. 40(1), 47–57 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Marinakis, Y., Migdalas, A., Sifaleras, A.: A hybrid particle swarm optimization—variable neighborhood search algorithm for constrained shortest path problems. Eur. J. Oper. Res. 261(3), 819–834 (2017)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Sánchez-Oro, J., Pantrigo, José J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. Part B 52, 209–219 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Mladenović, N., Todosijević, R., Urošević, D.: Two level general variable neighborhood search for attractive traveling salesman problem. Comput. Oper. Res. Part B 52, 341–348 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, NJ (2002). (Chapter 2)zbMATHGoogle Scholar
  23. 23.
    Zhang, G., Shao, X., Li, P., et al.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56(4), 1309–1318 (2009)CrossRefGoogle Scholar
  24. 24.
    Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. 32(1), 1–13 (2002)CrossRefzbMATHGoogle Scholar
  25. 25.
    Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3), 245–276 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Management EngineeringZhengzhou University of AeronauticsZhengzhouChina
  2. 2.Department of Information EngineeringHenan Vocational College of Water Conservancy and EnvironmentZhengzhouChina
  3. 3.Applied Physics InstituteHenan Academy of SciencesZhengzhouChina
  4. 4.Department of Industrial and Systems EngineeringUniversity at BuffaloBuffaloUSA

Personalised recommendations