Skip to main content

Advertisement

SpringerLink
Log in

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

  • Published:
Cluster Computing Aims and scope Submit manuscript

A Correction to this article was published on 02 April 2018

This article has been updated

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Change history

  • 02 April 2018

    The original version of this article unfortunately contained a mistake in the acknowledgement statement. It should read as follow “This paper presents work funded by the National Natural Science Foundation of China (No. 61203179), Excellent Youth Foundation of Science & Technology Innovation of Henan Province (No. 184100510001), and Key scientific research projects of Henan Province (No. 182102210457). Also, we would like to thank the Collaborative Innovation Center for Aviation Economy Development of Henan Province.”.

    The oricd of the corresponding author is revised to http://orcid.org/0000-0001-9143-2922. Also the e-mail of the corresponding author is revised to zgh_hust@qq.com.

References

  1. Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  8. Yuan, Y., Xu, H.: Flexible job shop scheduling using hybrid differential evolution algorithms. Comput. Ind. Eng. 65(2), 246–260 (2013)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  13. Ziaee, M.: A heuristic algorithm for the distributed and flexible job-shop scheduling problem. J. Supercomput. 67(1), 69–83 (2014)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  16. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  18. Jarboui, B., Derbel, H., Hanafi, S., et al.: Variable neighborhood search for location routing. Comput. Oper. Res. 40(1), 47–57 (2013)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  22. Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, NJ (2002). (Chapter 2)

    MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  26. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)

    Article  Google Scholar 

Download references

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.

Author information

Authors and Affiliations

  1. School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou, China

    Guohui Zhang & Yongcheng Wang

  2. Department of Information Engineering, Henan Vocational College of Water Conservancy and Environment, Zhengzhou, China

    Lingjie Zhang

  3. Applied Physics Institute, Henan Academy of Sciences, Zhengzhou, China

    Xiaohui Song

  4. Department of Industrial and Systems Engineering, University at Buffalo, Buffalo, USA

    Chi Zhou

Authors
  1. Guohui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lingjie Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaohui Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yongcheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chi Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guohui Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, G., Zhang, L., Song, X. et al. A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Cluster Comput 22 (Suppl 5), 11561–11572 (2019). https://doi.org/10.1007/s10586-017-1420-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-1420-4

Keywords

Search

Navigation