A new leader guided optimization for the flexible job shop problem

  • Fraj Naifar
  • Mariem GzaraEmail author
  • Moalla Taicir Loukil


The FJSP is an extension of the classical job shop problem which has been proven to be among the hardest combinatorial optimization problems, by allowing an operation to be operated on more than one machine from a machine set, with possibility of variable performances. In this work, we have designed a co-evolutionary algorithm that applies adaptively multiple crossover and mutation operators. In the evolution process, all new generated individuals are improved by local search. Combined with a new leader tree guided optimization search, the hybrid algorithm has discovered 2 new optimal solutions for instances of Hurink et al. (Oper Res Spektrum 15(4):205–215, 1994). In general, the outcomes of simulation results and comparisons demonstrate comparable results. The leader guided optimization has shown its effectiveness for minimizing the makespan in a FJSP, but it is not limited to this environment.


Scheduling Flexible job shop problem Evolutionary algorithm Leader guided optimization Multiple crossovers 



  1. Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial scheduling. Prentice-Hall, Upper Saddle River, pp 225–251Google Scholar
  2. Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job-shop scheduling problems. Sci Direct Comput Oper Res 35(9):2892–2907MathSciNetCrossRefzbMATHGoogle Scholar
  3. Gen M, Gao J, Lin L (2009) Multistage-based genetic algorithm for flexible job shop scheduling problem. In: Intelligent and evolutionary systems. Volume 187 of the series studies in computational intelligence, pp 183–196Google Scholar
  4. Hurink E, Jurisch B, Thole M (1994) Tabu search for the job shop scheduling problem with multi-purpose machine. Oper Res Spektrum 15(4):205–215MathSciNetCrossRefzbMATHGoogle Scholar
  5. Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3–20MathSciNetCrossRefzbMATHGoogle Scholar
  6. Mesghouni K, Hammadi S, Borne P (2004) Evolutionary algorithms for job-shop scheduling. Int J Appl Math Comput Sci 14(1):91–103MathSciNetzbMATHGoogle Scholar
  7. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42(6):797–813CrossRefzbMATHGoogle Scholar
  8. Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job shop scheduling problem. Comput Oper Res 35(10):3202–3212CrossRefzbMATHGoogle Scholar
  9. Roy B, Sussmann B (1964) Les problèmes d’ordonnancement avec contraintes disjonctives. Note DS N°. 9bis, SEMA MontrougeGoogle Scholar
  10. Singh MR, Mahapatra SS (2016) A quantum behaved particle swarm optimization for flexible job shop scheduling. Comput Ind Eng 93:36–44CrossRefGoogle Scholar
  11. Thierens D (2007) Adaptive strategies for operator allocation. Volume 54 of the series studies in computational intelligence, pp 77–90Google Scholar
  12. Zhang G, Zhu H, Zhang C (2011) Hybrid intelligent algorithm for flexible job-shop scheduling problem under uncertainty. In: Mellouk A (ed) Advances in reinforcement learning, Chapter 19, pp 361–370Google Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Digital Research Center of SfaxSfaxTunisia
  2. 2.Multimedia InfoRmation Systems and Advanced Computing Laboratory MIRACLSfaxTunisia
  3. 3.University of Monastir and Computer ScienceMonastirTunisia
  4. 4.High School of Mathematics and Computer ScienceMonastirTunisia
  5. 5.Faculty of Business AdministrationTabuk UniversityTabukKingdom of Saudi Arabia

Personalised recommendations