Skip to main content
SpringerLink
Log in

Review for Flexible Job Shop Scheduling

  • Chapter
  • First Online:
Effective Methods for Integrated Process Planning and Scheduling

Part of the book series: Engineering Applications of Computational Methods ((EACM,volume 2))

Abstract

Flexible Job shop Scheduling Problem (FJSP) is an NP-hard combinatorial optimization problem, which has significant applications in the real world. Due to the complexity and significance, lots of attention have been attracted to tackle this problem. In this paper, the existing solution methods for the FJSP in the recent literature are classified into exact algorithms, heuristics, and meta-heuristics, which are reviewed comprehensively. Moreover, the real-world applications of the FJSP are also introduced. Finally, the development trends for the manufacturing industry are analyzed, and then the future research opportunities of the FJSP are summarized in detail.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48(2):409–425

    Article  Google Scholar 

  2. Akyol DE, Bayhan GM (2007) A review on evolution of production scheduling with neural networks. Comput Ind Eng 53(1):95–122

    Article  Google Scholar 

  3. Gonçalves JF, de Magalhães Mendes JJ, Resende MG (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167(1):77–95

    Article  MathSciNet  MATH  Google Scholar 

  4. Çaliş B, Bulkan S (2015) A research survey: review of AI solution strategies of job shop scheduling problem. J Intell Manuf 26(5):961–973

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Operat Res 23(3):551–591

    Article  MathSciNet  MATH  Google Scholar 

  7. Gao K-Z, Suganthan PN, Pan Q-K, Chua TJ, Cai TX, Chong C-S (2014) Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf Sci 289:76–90

    Article  MathSciNet  MATH  Google Scholar 

  8. Kacem I, Hammadi S, Borne P (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Sys Man Cyber Part C (Applications and Reviews) 32(1):1–13

    Google Scholar 

  9. Stecke KE (1983) Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems. Manage Sci 29(3):273–288

    Article  MATH  Google Scholar 

  10. Sawik T (1990) Modelling and scheduling of a flexible manufacturing system. Eur J Oper Res 45(2–3):177–190

    Article  MATH  Google Scholar 

  11. de Werra D, Widmer M (1991) Loading problems with tool management in flexible manufacturing systems: a few integer programming models. Int J Flex Manuf Syst 3(1):71–82

    Article  Google Scholar 

  12. Jiang J, Hsiao W-C (1994) Mathematical programming for the scheduling problem with alternate process plans in FMS. Comput Ind Eng 27(1–4):15–18

    Article  Google Scholar 

  13. Tetzlaff UA, Pesch E (1999) Optimal workload allocation between a job shop and an FMS. IEEE Trans Robot Autom 15(1):20–32

    Article  Google Scholar 

  14. Gomes M, Barbosa-Povoa A, Novais A (2005) Optimal scheduling for flexible job shop operation. Int J Produc Res 43(11):2323–2353

    Google Scholar 

  15. Torabi S, Karimi B, Ghomi SF (2005) The common cycle economic lot scheduling in flexible job shops: The finite horizon case. Int J Prod Econ 97(1):52–65

    Article  Google Scholar 

  16. Özgüven C, Özbakır L, Yavuz Y (2010) Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl Math Model 34(6):1539–1548

    Article  MathSciNet  MATH  Google Scholar 

  17. Elazeem AEMA, Osman MSA, Hassan MBA (2011) Optimality of the flexible job shop scheduling problem. African J Math Comput Sci Res 4(10):321–328

    Google Scholar 

  18. Özgüven C, Yavuz Y, Özbakır L (2012) Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Appl Math Model 36(2):846–858

    Article  MathSciNet  MATH  Google Scholar 

  19. Jahromi M, Tavakkoli-Moghaddam R (2012) A novel 0-1 linear integer programming model for dynamic machine-tool selection and operation allocation in a flexible manufacturing system. J Manuf Sys 31(2):224–231

    Article  Google Scholar 

  20. Roshanaei V, Azab A, ElMaraghy H (2013) Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int J Prod Res 51(20):6247–6274

    Article  Google Scholar 

  21. Birgin EG, Feofiloff P, Fernandes CG, De Melo EL, Oshiro MT, Ronconi DP (2014) A MILP model for an extended version of the Flexible Job Shop Problem. Optimiz Lett 8(4):1417–1431

    Article  MathSciNet  MATH  Google Scholar 

  22. Berrada M, Stecke KE (1986) A branch and bound approach for machine load balancing in flexible manufacturing systems. Manage Sci 32(10):1316–1335

    Article  MATH  Google Scholar 

  23. Kim Y-D, Yano CA (1994) A new branch and bound algorithm for loading problems in flexible manufacturing systems. Int J Flex Manuf Syst 6(4):361–381

    Article  Google Scholar 

  24. Zhou M, Chiu H-S, Xiong HH (1995) Petri net scheduling of FMS using branch and bound method. Paper presented at the Proceedings of IECON’95–21st Annual Conference on IEEE Industrial Electronics

    Google Scholar 

  25. Lloyd S, Yu H, Konstas N (1995) FMS scheduling using Petri net modeling and a branch & bound search. Paper presented at the Proceedings. IEEE International Symposium on Assembly and Task Planning

    Google Scholar 

  26. Hansmann RS, Rieger T, Zimmermann UT (2014) Flexible job shop scheduling with blockages. Math Methods Oper Res 79(2):135–161

    Article  MathSciNet  MATH  Google Scholar 

  27. Gomes MC, Barbosa-Póvoa AP, Novais AQ (2013) Reactive scheduling in a make-to-order flexible job shop with re-entrant process and assembly: a mathematical programming approach. Int J Prod Res 51(17):5120–5141

    Article  Google Scholar 

  28. Gran SS, Ismail I, Ajol TA, Ibrahim AFA (2015) Mixed integer programming model for flexible job-shop scheduling problem (FJSP) to minimize makespan and total machining time. Paper presented at the Computer, Communications, and Control Technology (I4CT), 2015 International Conference on

    Google Scholar 

  29. Shanker K, Tzen Y-JJ (1985) A loading and dispatching problem in a random flexible manufacturing system. Int J Prod Res 23(3):579–595

    Article  MATH  Google Scholar 

  30. Chang Y-L, Matsuo H, Sullivan RS (1989) A bottleneck-based beam search for job scheduling in a flexible manufacturing system. Int J Produc Res 27(11):1949–1961

    Google Scholar 

  31. Ro I-K, Kim J-I (1990) Multi-criteria operational control rules in flexible manufacturing systems (FMSs). Int J Produc Res 28(1):47–63

    Article  Google Scholar 

  32. O’Keefe RM, Kasirajan T (1992) Interaction between dispatching and next station selection rules in a dedicated flexible manufacturing system. Int J Produc Res 30(8):1753–1772

    Google Scholar 

  33. Xiong HH, Zhou M, Caudill RJ (1996) A hybrid heuristic search algorithm for scheduling flexible manufacturing systems. Paper presented at the Proceedings of IEEE International Conference on Robotics and Automation

    Google Scholar 

  34. Jeong K-C, Kim Y-D (1998) A real-time scheduling mechanism for a flexible manufacturing system: using simulation and dispatching rules. Int J Prod Res 36(9):2609–2626

    Article  MATH  Google Scholar 

  35. Mati Y, Rezg N, Xie X (2001) An integrated greedy heuristic for a flexible job shop scheduling problem. Paper presented at the Systems, Man, and Cybernetics, 2001 IEEE International Conference on

    Google Scholar 

  36. Scrich CR, Armentano VA, Laguna M (2004) Tardiness minimization in a flexible job shop: A tabu search approach. J Intell Manuf 15(1):103–115

    Article  Google Scholar 

  37. Mejía G, Odrey NG (2005) An approach using Petri Nets and improved heuristic search for manufacturing system scheduling. J Manufac Sys 24(2):79–92

    Article  Google Scholar 

  38. Alvarez-Valdés R, Fuertes A, Tamarit JM, Giménez G, Ramos R (2005) A heuristic to schedule flexible job-shop in a glass factory. Eur J Oper Res 165(2):525–534

    Article  MATH  Google Scholar 

  39. Pitts Jr RA, Ventura JA (2007) A heuristic algorithm for minimizing makespan in a flexible manufacturing environment. Paper presented at the IIE Annual Conference. Proceedings

    Google Scholar 

  40. Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331–342

    Article  Google Scholar 

  41. Huang B, Sun Y, Sun Y (2008) Scheduling of flexible manufacturing systems based on Petri nets and hybrid heuristic search. Int J Prod Res 46(16):4553–4565

    Article  MATH  Google Scholar 

  42. Shi-Jin W, Bing-Hai Z, Li-Feng X (2008) A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem. Int J Prod Res 46(11):3027–3058

    Article  MATH  Google Scholar 

  43. Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54(3):453–473

    Article  Google Scholar 

  44. Wang S, Yu J (2010) An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput Ind Eng 59(3):436–447

    Article  MathSciNet  Google Scholar 

  45. Lee J, Lee JS (2010) Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix. Comput Ind Eng 59(4):799–806

    Article  Google Scholar 

  46. Nie L, Gao L, Li P, Li X (2013) A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J Intell Manuf 24(4):763–774

    Article  Google Scholar 

  47. Yuan Y, Xu H (2013) An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput Oper Res 40(12):2864–2877

    Article  MathSciNet  MATH  Google Scholar 

  48. Ziaee M (2014) A heuristic algorithm for solving flexible job shop scheduling problem. Int J Adv Manufac Technol 71(1–4):519–528

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  50. Calleja G, Pastor R (2014) A dispatching algorithm for flexible job-shop scheduling with transfer batches: an industrial application. Prod Plan Cont 25(2):93–109

    Article  Google Scholar 

  51. Baruwa OT, Piera MA (2014) Anytime heuristic search for scheduling flexible manufacturing systems: a timed colored Petri net approach. Int J Adv Manufac Technol 75(1–4):123–137

    Article  Google Scholar 

  52. Baruwa OT, Piera MA, Guasch A (2015) Deadlock-free scheduling method for flexible manufacturing systems based on timed colored Petri nets and anytime heuristic search. IEEE Trans Sys Man Cyber Sys 45(5):831–846

    Article  Google Scholar 

  53. Gao KZ, Suganthan PN, Tasgetiren MF, Pan QK, Sun QQ (2015) Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion. Comput Ind Eng 90:107–117

    Article  Google Scholar 

  54. Pérez MAF, Raupp FM (2016) A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem. J Intell Manuf 27(2):409–416

    Article  Google Scholar 

  55. Sobeyko O, Mönch L (2016) Heuristic approaches for scheduling jobs in large-scale flexible job shops. Comput Oper Res 68:97–109

    Article  MathSciNet  MATH  Google Scholar 

  56. Romero MAF, García EAR, Ponsich A, Gutiérrez RAM (2018) A heuristic algorithm based on tabu search for the solution of flexible job shop scheduling problems with lot streaming. Paper presented at the Proceedings of the Genetic and Evolutionary Computation Conference

    Google Scholar 

  57. Shahgholi Zadeh M, Katebi Y, Doniavi A (2018) A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times. Int J Produc Res, 1–16

    Google Scholar 

  58. Ortíz MA, Betancourt LE, Negrete KP, De Felice F, Petrillo A (2018) Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry. Ann Oper Res 264(1–2):409–433

    Article  MathSciNet  MATH  Google Scholar 

  59. Teymourifar A, Ozturk G, Ozturk ZK, Bahadir O (2018) Extracting new dispatching rules for multi-objective dynamic flexible job shop scheduling with limited buffer spaces. Cog Comput, 1–11

    Google Scholar 

  60. Ozturk G, Bahadir O, Teymourifar A (2018) Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming. Int J Produc Res, 1–17

    Google Scholar 

  61. Bekkar A, Belalem G, Beldjilali B (2019) Iterated greedy insertion approaches for the flexible job shop scheduling problem with transportation times constraint. Int J Manuf Res 14(1):43–66

    Article  Google Scholar 

  62. Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892–2907

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  64. Chen JC, Wu C-C, Chen C-W, Chen K-H (2012) Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm. Exp Syst Appl 39(11):10016–10021

    Article  Google Scholar 

  65. Chang H-C, Chen Y-P, Liu T-K, Chou J-H (2015) Solving the flexible job shop scheduling problem with makespan optimization by using a hybrid Taguchi-genetic algorithm. IEEE Access 3:1740–1754

    Article  Google Scholar 

  66. Nouri HE, Driss OB, Ghédira K (2015) Hybrid metaheuristics within a holonic multiagent model for the flexible job shop problem. Proc Comput Sci 60:83–92

    Article  Google Scholar 

  67. Liangxiao J, Zhongjun D (2015) An improved genetic algorithm for flexible job shop scheduling problem. Paper presented at the Information Science and Control Engineering (ICISCE), 2015 2nd International Conference on

    Google Scholar 

  68. Huang M, Mingxu W, Xu L (2016) An improved genetic algorithm using opposition-based learning for flexible job-shop scheduling problem. Paper presented at the Cloud Computing and Internet of Things (CCIOT), 2016 2nd International Conference on

    Google Scholar 

  69. Huang M, Wang L-M, Liang X (2016) An improved adaptive genetic algorithm in flexible job shop scheduling. Paper presented at the Cloud Computing and Internet of Things (CCIOT), 2016 2nd International Conference on

    Google Scholar 

  70. Driss I, Mouss KN, Laggoun A (2015) An effective genetic algorithm for the flexible job shop scheduling problems

    Google Scholar 

  71. Purnomo MRA (2016) A knowledge-based genetic algorithm for solving flexible job shop scheduling problem. Int Bus Manag 10(19):4708–4712

    Google Scholar 

  72. Morinaga E, Sakaguchi Y, Wakamatsu H, Arai E (2017) A method for flexible job-shop scheduling using genetic algorithm. J Adv Manufac Technol (JAMT) 11(2):79–86

    Google Scholar 

  73. Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110

    Article  Google Scholar 

  74. Gu X, Huang M, Liang X (2017) The improved simulated annealing genetic algorithm for flexible job-shop scheduling problem. Paper presented at the Computer Science and Network Technology (ICCSNT), 2017 6th International Conference on

    Google Scholar 

  75. Zhang G, Zhang L, Song X, Wang Y, Zhou C (2018) A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Cluster Comput, 1–12

    Google Scholar 

  76. Ma W, Zuo Y, Zeng J, Liang S, Jiao L (2014) A memetic algorithm for solving flexible job-shop scheduling problems. Paper presented at the Evolutionary Computation (CEC), 2014 IEEE Congress on

    Google Scholar 

  77. Cinar D, Oliveira JA, Topcu YI, Pardalos PM (2016) A priority-based genetic algorithm for a flexible job shop scheduling problem. J Ind Manag Optimi 12(4):1391–1415

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  79. Türkyılmaz A, Bulkan S (2015) A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution. Int J Prod Res 53(6):1832–1848

    Article  Google Scholar 

  80. Kaweegitbundit P, Eguchi T (2016) Flexible job shop scheduling using genetic algorithm and heuristic rules. J Adv Mec Design Sys Manufac 10(1):JAMDSM0010-JAMDSM0010

    Google Scholar 

  81. Frutos M, Olivera AC, Tohmé F (2010) A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Ann Oper Res 181(1):745–765

    Article  MathSciNet  Google Scholar 

  82. Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans Autom Sci Eng 12(1):336–353

    Article  Google Scholar 

  83. Liang X, Weiping S, Huang M (2015) Flexible job shop scheduling based on multi-population genetic-variable neighborhood search algorithm. Paper presented at the Computer Science and Network Technology (ICCSNT), 2015 4th International Conference on

    Google Scholar 

  84. Ren H, Xu H, Sun S (2016) Immune genetic algorithm for multi-objective flexible job-shop scheduling problem. Paper presented at the Control and Decision Conference (CCDC), 2016 Chinese

    Google Scholar 

  85. Morinaga Y, Nagao M, Sano M (2016) Balancing setup workers’ load of flexible job shop scheduling using hybrid genetic algorithm with tabu search strategy. Int J Decision Support Sys 2(1–3):71–90

    Article  Google Scholar 

  86. Xu L, Xia ZY, Ming H (2016) Study on improving multi-objective flexible job shop scheduling based on Memetic algorithm in the NSGA-II framework. Paper presented at the Cloud Computing and Internet of Things (CCIOT), 2016 2nd International Conference on

    Google Scholar 

  87. Deng Q, Gong G, Gong X, Zhang L, Liu W, Ren Q (2017) A bee evolutionary guiding nondominated sorting genetic algorithm ii for multiobjective flexible job-shop scheduling. Comput int neurosci, 2017

    Google Scholar 

  88. Zhang W, Wen J, Zhu Y, Hu Y (2017) Multi-objective scheduling simulation of flexible job-shop based on multi-population genetic algorithm. Int J Simulat Model 16(2):313–321

    Article  Google Scholar 

  89. Ghasemi M, Farzan A (2017) Pareto-front generation by classical and meta-heuristic methods in flexible job shop scheduling with multiple objectives. Int J Comput Appl 165(1)

    Google Scholar 

  90. Teymourifar A, Ozturk G, Bahadir O (2018) A comparison between two modified NSGA-II algorithms for solving the multi-objective flexible job shop scheduling problem. Univer J Applied Math 6(3):79–93

    Article  Google Scholar 

  91. Tayebi Araghi M, Jolai F, Rabiee M (2014) Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach. Int J Comput Integr Manuf 27(8):733–746

    Article  Google Scholar 

  92. Jalilvand-Nejad A, Fattahi P (2015) A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem. J Intell Manuf 26(6):1085–1098

    Article  Google Scholar 

  93. Rohaninejad M, Kheirkhah A, Fattahi P (2015) Simultaneous lot-sizing and scheduling in flexible job shop problems. Int J Adv Manufac Technol 78(1–4):1–18

    Article  Google Scholar 

  94. Rey GZ, Bekrar A, Trentesaux D, Zhou B-H (2015) Solving the flexible job-shop just-in-time scheduling problem with quadratic earliness and tardiness costs. Int J Adv Manufac Technol 81(9–12):1871–1891

    Google Scholar 

  95. Zhang M, Wu K (2016) An improved genetic algorithm for the re-entrant and flexible job-shop scheduling problem. Paper presented at the Control and Decision Conference (CCDC), 2016 Chinese

    Google Scholar 

  96. Li H, Li Z, Yang R, Lu H, Zhang Y (2016) A flexible job-shop scheduling for small batch customizing. Paper presented at the Control and Decision Conference (CCDC), 2016 Chinese

    Google Scholar 

  97. Chang H-C, Liu T-K (2017) Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J Intell Manuf 28(8):1973–1986

    Article  Google Scholar 

  98. Lu P-H, Wu M-C, Tan H, Peng Y-H, Chen C-F (2018) A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems. J Intell Manuf 29(1):19–34

    Article  Google Scholar 

  99. Azzouz A, Ennigrou M, Said LB (2017b) A self-adaptive evolutionary algorithm for solving flexible job-shop problem with sequence dependent setup time and learning effects. Paper presented at the Evolutionary Computation (CEC), 2017 IEEE Congress on

    Google Scholar 

  100. Elgendy A, Mohammed H, Elhakeem A (2017) Optimizing dynamic flexible job shop scheduling problem based on genetic algorithm. Int J Curr Eng Technol 7:368–373

    Google Scholar 

  101. Chen M, Li J-L (2017) Genetic algorithm combined with gradient information for flexible job-shop scheduling problem with different varieties and small batches. Paper presented at the MATEC Web of Conferences

    Google Scholar 

  102. Wang L, Luo C, Cai J (2017) A variable interval rescheduling strategy for dynamic flexible job shop scheduling problem by improved genetic algorithm. J Adv Trans, 2017

    Google Scholar 

  103. Peng C, Fang Y, Lou P, Yan J (2018) Analysis of double-resource flexible job shop scheduling problem based on genetic algorithm. Paper presented at the Networking, Sensing and Control (ICNSC), 2018 IEEE 15th International Conference on

    Google Scholar 

  104. Ahmadi E, Zandieh M, Farrokh M, Emami SM (2016) A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput Oper Res 73:56–66

    Article  MathSciNet  MATH  Google Scholar 

  105. Yang X, Zeng Z, Wang R, Sun X (2016) Bi-objective flexible job-shop scheduling problem considering energy consumption under stochastic processing times. PLoS ONE 11(12):e0167427

    Article  Google Scholar 

  106. Wang C, Tian N, Ji Z, Wang Y (2017) Multi-objective fuzzy flexible job shop scheduling using memetic algorithm. J Stat Comput Simul 87(14):2828–2846

    Article  MathSciNet  MATH  Google Scholar 

  107. Jiang Z, Zuo L, Mingcheng E (2014) Study on multi-objective flexible job-shop scheduling problem considering energy consumption. J Ind Eng Manag 7(3):589–604

    Google Scholar 

  108. Yin L, Li X, Gao L, Lu C, Zhang Z (2017) A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem. Sustain Comput Inform Sys 13:15–30

    Google Scholar 

  109. Piroozfard H, Wong KY, Wong WP (2018) Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm. Resour Conserv Recycl 128:267–283

    Article  Google Scholar 

  110. Wu X, Sun Y (2018) A green scheduling algorithm for flexible job shop with energy-saving measures. J Clean Prod 172:3249–3264

    Article  Google Scholar 

  111. Zhang C, Gu P, Jiang P (2015) Low-carbon scheduling and estimating for a flexible job shop based on carbon footprint and carbon efficiency of multi-job processing. Proceed Ins Mec Eng Part B: J Eng Manufac 229(2):328–342

    Article  Google Scholar 

  112. Azzouz A, Ennigrou M, Said LB (2017a) A hybrid algorithm for flexible job-shop scheduling problem with setup times

    Google Scholar 

  113. Marzouki B, Driss OB (2015) Multi agent model based on chemical reaction optimization for flexible job shop problem. In Computational collective intelligence (pp 29–38), Springer

    Google Scholar 

  114. Marzouki B, Driss OB, Ghédira K (2018) Multi-agent model based on combination of chemical reaction optimisation metaheuristic with Tabu search for flexible job shop scheduling problem. Int J Int Eng Inf 6(3–4):242–265

    Google Scholar 

  115. Yang Y (2015) A modified biogeography-based optimization for the flexible job shop scheduling problem. Mathematical problems in engineering, 2015

    Google Scholar 

  116. Lin J (2015) A hybrid biogeography-based optimization for the fuzzy flexible job-shop scheduling problem. Knowl-Based Syst 78:59–74

    Article  Google Scholar 

  117. Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309–1318

    Article  Google Scholar 

  118. Singh MR, Mahapatra SS (2016) A quantum behaved particle swarm optimization for flexible job shop scheduling. Comput Ind Eng 93:36–44

    Article  Google Scholar 

  119. Muthiah A, Rajkumar A, Rajkumar R (2016) Hybridization of artificial bee colony algorithm with particle swarm optimization algorithm for flexible job shop scheduling. Paper presented at the Energy Efficient Technologies for Sustainability (ICEETS), 2016 International Conference on

    Google Scholar 

  120. Yi W, Li X, Pan B (2016) Solving flexible job shop scheduling using an effective memetic algorithm. Int J Comput Appl Technol 53(2):157–163

    Article  Google Scholar 

  121. Phu-ang A, Thammano A (2017) Memetic algorithm based on marriage in honey bees optimization for flexible job shop scheduling problem. Memetic Comput 9(4):295–309

    Article  Google Scholar 

  122. Ge H, Sun L, Chen X, Liang Y (2016) An efficient artificial fish swarm model with estimation of distribution for flexible job shop scheduling. Int J Comput Intell Sys 9(5):917–931

    Article  Google Scholar 

  123. Wang X, Yi P (2016) Improved bacteria foraging optimization algorithm for solving flexible job-shop scheduling problem

    Google Scholar 

  124. Wu X, Wu S (2017) An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem. J Intell Manuf 28(6):1441–1457

    Article  Google Scholar 

  125. Xu H, Bao Z, Zhang T (2017) Solving dual flexible job-shop scheduling problem using a Bat Algorithm. Adv Produc Eng Manag 12(1):5

    Article  MathSciNet  Google Scholar 

  126. Wang L, Cai J, Li M, Liu Z (2017) Flexible job shop scheduling problem using an improved ant colony optimization. Sci Program, 2017

    Google Scholar 

  127. Liang X, Huang M, Ning T (2018) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Humaniz Comput 9(1):165–171

    Article  Google Scholar 

  128. Buddala R, Mahapatra SS (2018) An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method. J Ind Eng Int, 1–12

    Google Scholar 

  129. Jiang T, Zhang C (2018) Application of grey wolf optimization for solving combinatorial problems: job shop and flexible job shop scheduling cases. IEEE Access

    Google Scholar 

  130. Gaham M, Bouzouia B, Achour N (2018) An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion. Appl Int 48(6):1423–1441

    Article  Google Scholar 

  131. Rabiee M, Zandieh M, Ramezani P (2012) Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches. Int J Prod Res 50(24):7327–7342

    Article  Google Scholar 

  132. Xue H, Zhang P, Wei S, Yang L (2014) An improved immune algorithm for multi-objective flexible job-shop scheduling. J Networks 9(10):2843

    Article  Google Scholar 

  133. Ma J, Lei Y, Wang Z, Jiao L, Liu R (2014) A memetic algorithm based on immune multi-objective optimization for flexible job-shop scheduling problems. Paper presented at the Evolutionary Computation (CEC), 2014 IEEE Congress on

    Google Scholar 

  134. Gong X, Deng Q, Gong G, Liu W, Ren Q (2018) A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility. Int J Prod Res 56(7):2506–2522

    Article  Google Scholar 

  135. Mekni S, Fayech BC (2014) A modified invasive weed optimization algorithm for multiobjective flexible job shop scheduling problems. Comput Sci Inf Technol, 51–60. DOI, 10

    Google Scholar 

  136. Karthikeyan S, Asokan P, Nickolas S (2014) A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints. Int J Adv Manufac Technol 72(9–12):1567–1579

    Article  Google Scholar 

  137. Kamble S, Mane S, Umbarkar A (2015) Hybrid multi-objective particle swarm optimization for flexible job shop scheduling problem. Int J Intell Sys App 7(4):54

    Google Scholar 

  138. Huang S, Tian N, Wang Y, Ji Z (2016) Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. SpringerPlus 5(1):1432

    Article  Google Scholar 

  139. Huang S, Tian N, Ji Z (2016) Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem. Int J Model Simul Sci Comput 7(03):1650024

    Article  Google Scholar 

  140. Zeng R, Wang Y (2018) A chaotic simulated annealing and particle swarm improved artificial immune algorithm for flexible job shop scheduling problem. EURASIP J Wireless Commun Network 2018(1):101

    Article  Google Scholar 

  141. Zhu H, He B, Li H (2017) Modified bat algorithm for the multi-objective flexible job shop scheduling problem. Int J Perform Eng 13(7)

    Google Scholar 

  142. Rossi A (2014) Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. Int J Prod Econ 153:253–267

    Article  Google Scholar 

  143. Xu Y, Wang L, Wang S-Y, Liu M (2015) An effective teaching–learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time. Neurocomputing 148:260–268

    Article  Google Scholar 

  144. Liu B, Fan Y, Liu Y (2015) A fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem. Comput Ind Eng 87:193–201

    Article  Google Scholar 

  145. Gao KZ, Suganthan PN, Chua TJ, Chong CS, Cai TX, Pan QK (2015) A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst Appl 42(21):7652–7663

    Article  Google Scholar 

  146. Gao KZ, Suganthan PN, Pan QK, Chua TJ, Chong CS, Cai TX (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52–67

    Article  Google Scholar 

  147. Meng T, Pan Q-K, Sang H-Y (2018) A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations. Int J Produc Res, 1–15

    Google Scholar 

  148. Zheng X-L, Wang L (2016) A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. Int J Prod Res 54(18):5554–5566

    Article  Google Scholar 

  149. Liu Q, Zhan M, Chekem FO, Shao X, Ying B, Sutherland JW (2017) A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint. J Clean Prod 168:668–678

    Article  Google Scholar 

  150. Zandieh M, Khatami A, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449–464

    Article  Google Scholar 

  151. Nouiri M, Bekrar A, Jemai A, Trentesaux D, Ammari AC, Niar S (2017) Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns. Comput Ind Eng 112:595–606

    Article  Google Scholar 

  152. Jamrus T, Chien C-F, Gen M, Sethanan K (2018) Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing. IEEE Trans Semicond Manuf 31(1):32–41

    Article  Google Scholar 

  153. Singh MR, Mahapatra S, Mishra R (2014) Robust scheduling for flexible job shop problems with random machine breakdowns using a quantum behaved particle swarm optimisation. Int J Ser Operat Manag 20(1):1–20

    Google Scholar 

  154. Reddy MS, Ratnam C, Rajyalakshmi G, Manupati V (2018) An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Measurement 114:78–90

    Article  Google Scholar 

  155. Zhang S, Wong TN (2017) Flexible job-shop scheduling/rescheduling in dynamic environment: a hybrid MAS/ACO approach. Int J Prod Res 55(11):3173–3196

    Article  Google Scholar 

  156. Azzouz A, Ennigrou M, Said LB (2017) A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time. Proc Comp Sci 112:457–466

    Article  Google Scholar 

  157. Mokhtari H, Dadgar M (2015) A flexible job shop scheduling problem with controllable processing times to optimize total cost of delay and processing. Int J Supply Operat Manag 2(3):871

    Google Scholar 

  158. Lu C, Li X, Gao L, Liao W, Yi J (2017) An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Comput Ind Eng 104:156–174

    Article  Google Scholar 

  159. Mokhtari H, Hasani A (2017) An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput Chem Eng 104:339–352

    Article  Google Scholar 

  160. Lei D, Zheng Y, Guo X (2017) A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption. Int J Prod Res 55(11):3126–3140

    Article  Google Scholar 

  161. Shen X-N, Han Y, Fu J-Z (2017) Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems. Soft Comput 21(21):6531–6554

    Article  Google Scholar 

  162. Baykasoglu A (2002) Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res 40(17):4523–4543

    Article  MATH  Google Scholar 

  163. Chen J, Chen K, Wu J, Chen C (2008) A study of the flexible job shop scheduling problem with parallel machines and reentrant process. Int J Adv Manufac Technol 39(3–4):344–354

    Article  Google Scholar 

  164. Abdi Khalife M, Abbasi B (2010) A simulated annealing algorithm for multi objective flexible job shop scheduling with overlapping in operations. J Opt Ind Eng, 17–28

    Google Scholar 

  165. Shivasankaran N, Senthilkumar P, Raja KV (2014) Hybrid non-dominated sorting simulated annealing Algorithm for flexible job shop scheduling problems. Paper presented at the ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India-Vol I

    Google Scholar 

  166. Shivasankaran N, Kumar PS, Raja KV (2015) Hybrid sorting immune simulated annealing algorithm for flexible job shop scheduling. Int J Comput Int Sys 8(3):455–466

    Article  Google Scholar 

  167. Bożejko W, Pempera J, Wodecki M (2015) Parallel simulated annealing algorithm for cyclic flexible job shop scheduling problem. Paper presented at the International Conference on Artificial Intelligence and Soft Computing

    Google Scholar 

  168. Kaplanoğlu V (2016) An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Syst Appl 45:71–84

    Article  Google Scholar 

  169. Karimi H, Rahmati SHA, Zandieh M (2012) An efficient knowledge-based algorithm for the flexible job shop scheduling problem. Knowl-Based Syst 36:236–244

    Article  Google Scholar 

  170. Lei D, Guo X (2014) Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. Int J Prod Res 52(9):2519–2529

    Article  Google Scholar 

  171. Vilcot G, Billaut J-C (2011) A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem. Int J Prod Res 49(23):6963–6980

    Article  Google Scholar 

  172. Jia S, Hu Z-H (2014) Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem. Comput Oper Res 47:11–26

    Article  MathSciNet  MATH  Google Scholar 

  173. Rajkumar M, Asokan P, Anilkumar N, Page T (2011) A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. Int J Prod Res 49(8):2409–2423

    Article  Google Scholar 

  174. Yulianty A, Ma’ruf A (2013) Predictive approach on flexible job shop scheduling problem considering controllable processing times. Int J Innov Manag Technol 4(6):565

    Article  Google Scholar 

  175. Li L, Huo J-Z (2009) Multi-objective flexible job-shop scheduling problem in steel tubes production. Sys Engineering-Theory Prac 29(8):117–126

    Article  Google Scholar 

  176. Grobler J, Engelbrecht AP, Kok S, Yadavalli S (2010) Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time. Ann Oper Res 180(1):165–196

    Article  MATH  Google Scholar 

  177. Hosseinabadi AAR, Siar H, Shamshirband S, Shojafar M, Nasir MHNM (2015) Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises. Ann Oper Res 229(1):451–474

    Article  MathSciNet  MATH  Google Scholar 

  178. Tanev IT, Uozumi T, Morotome Y (2004) Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach. Appl Soft Comput 5(1):87–100

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical Science and Engineering, HUST, State Key Laboratory of Digital Manufacturing and Equipment Technology, Wuhan, Hubei, China

    Xinyu Li

  2. School of Mechanical Science and Engineering, HUST, State Key Laboratory of Digital Manufacturing and Equipment Technology, Wuhan, Hubei, China

    Liang Gao

Authors
  1. Xinyu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xinyu Li .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer-Verlag GmbH Germany, part of Springer Nature and Science Press, Beijing

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, X., Gao, L. (2020). Review for Flexible Job Shop Scheduling. In: Effective Methods for Integrated Process Planning and Scheduling. Engineering Applications of Computational Methods, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55305-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55305-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55303-9

  • Online ISBN: 978-3-662-55305-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation