Skip to main content
SpringerLink
Log in

Improved gray wolf optimizer for distributed flexible job shop scheduling problem

  • Article
  • Published:
Science China Technological Sciences Aims and scope Submit manuscript

Abstract

The distributed flexible job shop scheduling problem (DFJSP), which is an extension of the flexible job shop scheduling problem, is a famous NP-complete combinatorial optimization problem. This problem is widespread in the manufacturing industries and comprises the following three subproblems: the assignment of jobs to factories, the scheduling of operations to machines, and the sequence of operations on machines. However, studies on DFJSP are seldom because of its difficulty. This paper proposes an effective improved gray wolf optimizer (IGWO) to solve the aforementioned problem. In this algorithm, new encoding and decoding schemes are designed to represent the three subproblems and transform the encoding into a feasible schedule, respectively. Four crossover operators are developed to expand the search space. A local search strategy with the concept of a critical factory is also proposed to improve the exploitability of IGWO. Effective schedules can be obtained by changing factory assignments and operation sequences in the critical factory. The proposed IGWO algorithm is evaluated on 69 famous benchmark instances and compared with six state-of-the-art algorithms to demonstrate its efficacy considering solution quality and computational efficiency. Experimental results show that the proposed algorithm has achieved good improvement. Particularly, the proposed IGWO updates the new upper bounds of 13 difficult benchmark instances.

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

Similar content being viewed by others

References

  1. Zhao F, He X, Wang L. A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem. IEEE Trans Cybern, 2020, 51: 5291–5303

    Article  Google Scholar 

  2. Branda A, Castellano D, Guizzi G, et al. Metaheuristics for the flow shop scheduling problem with maintenance activities integrated. Comput Ind Eng, 2021, 151: 106989

    Article  Google Scholar 

  3. Ye H, Wang X, Liu K. Adaptive preventive maintenance for flow shop scheduling with resumable processing. IEEE Trans Automat Sci Eng, 2020, 18: 106–113

    Article  Google Scholar 

  4. Gong G, Deng Q, Gong X, et al. A non-dominated ensemble fitness ranking algorithm for multi-objective flexible job-shop scheduling problem considering worker flexibility and green factors. Knowledge-Based Syst, 2021, 231: 107430

    Article  Google Scholar 

  5. Li K, Deng Q, Zhang L, et al. An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput Ind Eng, 2021, 155: 107211

    Article  Google Scholar 

  6. Li X, Gao L, Wang W, et al. Particle swarm optimization hybridized with genetic algorithm for uncertain integrated process planning and scheduling with interval processing time. Comput Ind Eng, 2019, 135: 1036–1046

    Article  Google Scholar 

  7. Liu Q, Li X, Gao L, et al. A modified genetic algorithm with new encoding and decoding Methods for integrated process planning and scheduling problem. IEEE Trans Cybern, 2020, 51: 4429–4438

    Article  Google Scholar 

  8. Wu X, Li J. Two layered approaches integrating harmony search with genetic algorithm for the integrated process planning and scheduling problem. Comput Ind Eng, 2021, 155: 107194

    Article  Google Scholar 

  9. Pezzella F, Morganti G, Ciaschetti G. A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res, 2008, 35: 3202–3212

    Article  MATH  Google Scholar 

  10. Chaudhry I A, Khan A A. A research survey: Review of flexible job shop scheduling techniques. Intl Trans Oper Res, 2016, 23: 551–591

    Article  MathSciNet  MATH  Google Scholar 

  11. Gong G, Chiong R, Deng Q, et al. A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. Int J Production Res, 2020, 58: 4406–4420

    Article  Google Scholar 

  12. Chen R, Yang B, Li S, et al. A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng, 2020, 149: 106778

    Article  Google Scholar 

  13. Li J, Liu Z, Li C, et al. Improved artificial immune system algorithm for type-2 fuzzy flexible job shop scheduling problem. IEEE Trans Fuzzy Syst, 2020, 29: 3234–3248

    Article  Google Scholar 

  14. Naderi B, Azab A. Modeling and heuristics for scheduling of distributed job shops. Expert Syst Appl, 2014, 41: 7754–7763

    Article  Google Scholar 

  15. Naderi B, Ruiz R. The distributed permutation flowshop scheduling problem. Computers Operations Research, 2010, 37: 754–768

    Article  MathSciNet  MATH  Google Scholar 

  16. Ruiz R, Pan Q K, Naderi B. Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega, 2019, 83: 213–222

    Article  Google Scholar 

  17. Sang H Y, Pan Q K, Li J Q, et al. Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion. Swarm Evolary Computation, 2019, 44: 64–73

    Article  Google Scholar 

  18. Pan Q K, Gao L, Li X Y, et al. Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl Soft Computing, 2019, 81: 105492

    Article  Google Scholar 

  19. Chaouch I, Driss O B, Ghedira K. A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm. Appl Intell, 2019, 49: 1903–1924

    Article  Google Scholar 

  20. Zhang G, Xing K. Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion. Comput Oper Res, 2019, 108: 33–43

    Article  MathSciNet  MATH  Google Scholar 

  21. Han X, Han Y, Chen Q, et al. Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated Greedy algorithm. Complex Syst Model Simul, 2021, 1: 198–217

    Article  Google Scholar 

  22. Lu C, Gao L, Yi J, et al. Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A real-world case from automobile industry in China. IEEE Trans Ind Inf, 2020, 17: 6687–6696

    Article  Google Scholar 

  23. De Giovanni L, Pezzella F. An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res, 2010, 200: 395–408

    Article  MATH  Google Scholar 

  24. Du Y, Li J, Luo C, et al. A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations. Swarm Evolary Computation, 2021, 62: 100861

    Article  Google Scholar 

  25. Meng L, Zhang C, Ren Y, et al. Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng, 2020, 142: 106347

    Article  Google Scholar 

  26. Xu W, Hu Y, Luo W, et al. A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission. Comput Ind Eng, 2021, 157: 107318

    Article  Google Scholar 

  27. Wang J, Liu Y, Ren S, et al. Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop. J Cleaner Production, 2021, 293: 126093

    Article  Google Scholar 

  28. Mirjalili S, Mirjalili S M, Lewis A. Grey wolf optimizer. Adv Eng Software, 2014, 69: 46–61

    Article  Google Scholar 

  29. Long W, Jiao J, Liang X, et al. Inspired grey wolf optimizer for solving large-scale function optimization problems. Appl Math Model, 2018, 60: 112–126

    Article  MathSciNet  MATH  Google Scholar 

  30. Mohanty S, Subudhi B, Ray P K. A new MPPT design using grey wolf optimization technique for photovoltaic system under partial shading conditions. IEEE Trans Sustain Energy, 2015, 7: 181–188

    Article  Google Scholar 

  31. Jiang T, Zhang C. Application of grey wolf optimization for solving combinatorial problems: Job shop and flexible job shop scheduling cases. IEEE Access, 2018, 6: 26231–26240

    Article  Google Scholar 

  32. Zhang C Y, Li P G, Guan Z L, et al. A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res, 2007, 34: 3229–3242

    Article  MathSciNet  MATH  Google Scholar 

  33. Gere Jr. W S. Heuristics in job shop scheduling. Manage Sci, 1966, 13: 167–190

    Article  Google Scholar 

  34. Zhang G, Gao L, Shi Y. An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl, 2011, 38: 3563–3573

    Article  Google Scholar 

  35. Nowicki E, Smutnicki C. A fast taboo search algorithm for the job shop problem. Manage Sci, 1996, 42: 797–813

    Article  MATH  Google Scholar 

  36. Ziaee M. A heuristic algorithm for the distributed and flexible jobshop scheduling problem. J Supercomput, 2014, 67: 69–83

    Article  Google Scholar 

  37. Marzouki B, Driss O B, Ghédira K. Decentralized Tabu searches in multi agent system for distributed and flexible job shop scheduling problem. In: Proceedings of 2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA). IEEE, 2017. 1019–1026

    Google Scholar 

  38. Marzouki B, Driss O B, Ghédira K. Solving distributed and flexible job shop scheduling problem using a chemical reaction optimization metaheuristic. Procedia Comput Sci, 2018, 126: 1424–1433

    Article  Google Scholar 

  39. Lu P H, Wu M C, Tan H, et al. A genetic algorithm embedded with a concise chromosome representation for distributed and flexible jobshop scheduling problems. J Intell Manuf, 2018, 29: 19–34

    Article  Google Scholar 

  40. Wu M C, Lin C S, Lin C H, et al. Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems. Comput Oper Res, 2017, 80: 101–112

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, 430074, China

    XinYu Li, Jin Xie, QingJi Ma, Liang Gao & PeiGen Li

Authors
  1. XinYu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. QingJi Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. PeiGen Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Gao.

Additional information

This work was supported by the National Natural Science Foundation of China (Grant Nos. 51825502 and U21B2029).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Xie, J., Ma, Q. et al. Improved gray wolf optimizer for distributed flexible job shop scheduling problem. Sci. China Technol. Sci. 65, 2105–2115 (2022). https://doi.org/10.1007/s11431-022-2096-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11431-022-2096-6

Keywords

Search

Navigation