Skip to main content

Greedy randomized adaptive search procedure for simultaneous scheduling of production and preventive maintenance activities in dynamic flexible job shops

Abstract

In the present study, we proposed a greedy randomized adaptive search procedure (GRASP) for integrated scheduling of dynamic flexible job shops with a novel preventive maintenance policy. In most of the real-life scheduling practices, unexpected and unknown events occur frequently, which necessitates solving operations and maintenance scheduling problems dynamically. Dynamic events like new order arrival, machine breakdown, changes in due date, order cancellation, and urgent order are considered in this study. Moreover, order acceptance/rejection decisions and an order review release mechanism are also taken into account in order to enhance the overall performance by adjusting capacity regarding to customer due date requirements. Four objectives namely mean tardiness, schedule instability, makespan, and mean flow time are considered within a lexicographic programming logic. Random test instances are generated for the stated dynamic scheduling problem. In order to confirm the applicability of the proposed GRASP-based algorithm, extensive experiments were also conducted on well-known job shop scheduling benchmark instances and flexible job shop scheduling benchmark instances with preventive maintenance activities. Computational experiments conducted under various experimental settings such as flexibility level and due date tightness in addition to different preventive maintenance policies. To the best of our knowledge, the present study presents the first attempt through GRASP for simultaneous dynamic scheduling of operations and preventive maintenance activities in flexible job shops. Results of the extensive computational experiments demonstrate that simultaneous scheduling of manufacturing operations and preventive maintenance activities is a viable and effective approach for performance improvement in dynamic flexible job shop scheduling environments.

This is a preview of subscription content, access via your institution.

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

References

  1. 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. https://doi.org/10.1016/j.cor.2016.03.009

    MathSciNet  Article  MATH  Google Scholar 

  2. Al-Hinai N, ElMekkawy TY (2011) Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ 132(2):279–291. https://doi.org/10.1016/j.ijpe.2011.04.020

    Article  Google Scholar 

  3. Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541. https://doi.org/10.1016/j.future.2009.10.004

    Article  Google Scholar 

  4. Baykasoğlu A (2002) Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res 40(17):4523–4543. https://doi.org/10.1080/00207540210147043

    Article  MATH  Google Scholar 

  5. Baykasoğlu A (2005) Preemptive goal programming using simulated annealing. Eng Opt 37(1):49–63. https://doi.org/10.1080/0305215042000268606

    MathSciNet  Article  Google Scholar 

  6. Baykasoğlu A, Göçken M (2011) A simulation based approach to analyse the effects of job release on the performance of a multi-stage job-shop with processing flexibility. Int J Prod Res 49(2):585–610. https://doi.org/10.1080/00207540903479778

    Article  Google Scholar 

  7. Baykasoğlu A, Karaslan FS (2017) Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach. Int J Prod Res 55(11):3308–3325. https://doi.org/10.1080/00207543.2017.1306134

    Article  Google Scholar 

  8. Baykasoğlu A, Ozsoydan FB (2017) Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization. Inf Sci 420:159–183. https://doi.org/10.1016/j.ins.2017.08.058

    Article  MATH  Google Scholar 

  9. Baykasoğlu A, Ozsoydan FB (2018) Dynamic scheduling of parallel heat treatment furnaces: a case study at a manufacturing system. J Manuf Syst 46:152–162. https://doi.org/10.1016/j.jmsy.2017.12.005

    Article  Google Scholar 

  10. Baykasoglu A, Hamzadayi A, Kose SY (2014) Testing the performance of teaching–learning based optimization (TLBO) algorithm on combinatorial problems: flow shop and job shop scheduling cases. Inf Sci 276:204–218

    MathSciNet  Article  Google Scholar 

  11. Baykasoğlu A, Madenoğlu FS, Hamzadayı A (2020) Greedy randomized adaptive search for dynamic flexible job-shop scheduling. J Manuf Syst 56:425–451. https://doi.org/10.1016/j.jmsy.2020.06.005

    Article  Google Scholar 

  12. Behringer FA (1977) Lexicographic quasiconcave multiobjective programming. Z Oper Res 21(3):103–116. https://doi.org/10.1007/BF01919766

    MathSciNet  Article  MATH  Google Scholar 

  13. Branke J, Mattfeld DC (2005) Anticipation and flexibility in dynamic scheduling. Int J Prod Res 43(15):3103–3129. https://doi.org/10.1080/00207540500077140

    Article  Google Scholar 

  14. Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183. https://doi.org/10.1007/BF02023073

    Article  MATH  Google Scholar 

  15. Caldeira RH, Gnanavelbabu A, Vaidyanathan T (2020) An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput Ind Eng 149:106863. https://doi.org/10.1016/j.cie.2020.106863

    Article  Google Scholar 

  16. Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23(3):551–591. https://doi.org/10.1111/itor.12199

    MathSciNet  Article  MATH  Google Scholar 

  17. Eaton J, Yang S, Mavrovouniotis M (2016) Ant colony optimization with immigrants schemes for the dynamic railway junction rescheduling problem with multiple delays. Soft Comput 20(8):2951–2966. https://doi.org/10.1007/s00500-015-1924-x

    Article  Google Scholar 

  18. El Khoukhi F, Boukachour J, Alaoui AEH (2017) The “dual-ants colony”: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput Ind Eng 106:236–255. https://doi.org/10.1016/j.cie.2016.10.019

    Article  Google Scholar 

  19. Fattahi P, Fallahi A (2010) Dynamic scheduling in flexible job s hop systems by considering simultaneously efficiency and stability. CIRP J Manuf Sci Technol 2(2):114–123. https://doi.org/10.1016/j.cirpj.2009.10.001

    Article  Google Scholar 

  20. Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109–133. https://doi.org/10.1007/BF01096763

    MathSciNet  Article  MATH  Google Scholar 

  21. Gao J, Gen M, Sun L (2006) Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J Intell Manuf 17(4):493–507. https://doi.org/10.1007/s10845-005-0021-x

    Article  Google Scholar 

  22. 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. https://doi.org/10.1016/j.eswa.2015.06.004

    Article  Google Scholar 

  23. Gao KZ, Suganthan PN, Pan QK, Tasgetiren MF, Sadollah A (2016a) Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl Based Syst 109:1–16. https://doi.org/10.1016/j.knosys.2016.06.014

    Article  Google Scholar 

  24. Gao KZ, Suganthan PN, Pan QK, Chua TJ, Cai TX, Chong CS (2016b) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J Intell Manuf 27(2):363–374. https://doi.org/10.1007/s10845-014-0869-8

    Article  Google Scholar 

  25. Gao K, Cao Z, Zhang L, Chen Z, Han Y, Pan Q (2019) A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE CAA J Auto Sin 6(4):904–916. https://doi.org/10.1109/JAS.2019.1911540

    Article  Google Scholar 

  26. Ghaleb M, Zolfagharinia H, Taghipour S (2020) Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns. Comput Oper Res 123:105031. https://doi.org/10.1016/j.cor.2020.105031

    MathSciNet  Article  MATH  Google Scholar 

  27. Gholami M, Zandieh M (2009) Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop. J Intell Manuf 20(4):481. https://doi.org/10.1007/s10845-008-0150-0

    Article  Google Scholar 

  28. Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487–503. https://doi.org/10.1287/opre.8.4.487

    MathSciNet  Article  MATH  Google Scholar 

  29. 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. https://doi.org/10.1080/00207543.2017.1388933

    Article  Google Scholar 

  30. He W, Sun DH (2013) Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies. Int J Adv Manuf Technol 66(1–4):501–514. https://doi.org/10.1007/s00170-012-4344-4

    Article  Google Scholar 

  31. Hu W, Wang H, Peng C, Wang H, Liang H, Du B (2015) An outer–inner fuzzy cellular automata algorithm for dynamic uncertainty multi-project scheduling problem. Soft Comput 19(8):2111–2132. https://doi.org/10.1007/s00500-014-1395-5

    Article  Google Scholar 

  32. Ji XP, Cao XB, Du WB, Tang K (2017) An evolutionary approach for dynamic single-runway arrival sequencing and scheduling problem. Soft Comput 21(23):7021–7037. https://doi.org/10.1007/s00500-016-2241-8

    Article  Google Scholar 

  33. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh

    Google Scholar 

  34. Li JQ, Pan QK (2012) Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity. Appl Soft Comput 12(9):2896–2912. https://doi.org/10.1016/j.asoc.2012.04.012

    Article  Google Scholar 

  35. Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38(3):1111–1132. https://doi.org/10.1016/j.apm.2013.07.038

    MathSciNet  Article  MATH  Google Scholar 

  36. Li X, Peng Z, Du B, Guo J, Xu W, Zhuang K (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng 113:10–26. https://doi.org/10.1016/j.cie.2017.09.005

    Article  Google Scholar 

  37. Li Y, Huang W, Wu R, Guo K (2020) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput 95:106544. https://doi.org/10.1016/j.asoc.2020.106544

    Article  Google Scholar 

  38. Lin L, Gen M, Liang Y, Ohno K (2012) A hybrid EA for reactive flexible job-shop scheduling. Procedia Comput Sci 12:110–115. https://doi.org/10.1016/j.procs.2012.09.039

    Article  Google Scholar 

  39. Luo S (2020) Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl Soft Comput 91:106208. https://doi.org/10.1016/j.asoc.2020.106208

    Article  Google Scholar 

  40. Mihoubi B, Bouzouia B, Gaham M (2020) Reactive scheduling approach for solving a realistic flexible job shop scheduling problem. Int J Prod Res. https://doi.org/10.1080/00207543.2020.1790686

    Article  Google Scholar 

  41. Moustafa M, Habib I, Naghshineh M (2005) GAME based dynamic resource scheduling in QoS aware radio access networks. Soft Comput 9(2):101–115. https://doi.org/10.1007/s00500-003-0352-5

    Article  Google Scholar 

  42. 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. https://doi.org/10.1007/s10845-012-0626-9

    Article  Google Scholar 

  43. Ning T, Huang M, Liang X, Jin H (2016) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Hum Comput 7(5):721–729. https://doi.org/10.1007/s12652-016-0370-7

    Article  Google Scholar 

  44. 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. https://doi.org/10.1016/j.cie.2017.03.006

    Article  Google Scholar 

  45. Nouiri M, Bekrar A, Jemai A, Niar S, Ammari AC (2018) An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J Intell Manuf 29(3):603–615. https://doi.org/10.1007/s10845-015-1039-3

    Article  Google Scholar 

  46. Ozturk G, Bahadir O, Teymourifar A (2019) Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming. Int J Prod Res 57(10):3121–3137. https://doi.org/10.1080/00207543.2018.1543964

    Article  Google Scholar 

  47. Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202–3212. https://doi.org/10.1016/j.cor.2007.02.014

    Article  MATH  Google Scholar 

  48. Ragatz GL, Mabert VA (1988) An evaluation of order release mechanisms in a job-shop environment. Dec Sci 19(1):167–189. https://doi.org/10.1111/j.1540-5915.1988.tb00260.x

    Article  Google Scholar 

  49. Rahmati SHA, Zandieh M (2012) A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. Int J Adv Manuf Technol 58(9):1115–1129. https://doi.org/10.1007/s00170-011-3437-9

    Article  Google Scholar 

  50. Rahmati SHA, Ahmadi A, Govindan K (2018) A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach. Ann Oper Res 269(1):583–621. https://doi.org/10.1007/s10479-017-2594-0

    MathSciNet  Article  MATH  Google Scholar 

  51. Rajabinasab A, Mansour S (2011) Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach. Int J Adv Manuf Technol 54(9–12):1091–1107. https://doi.org/10.1007/s00170-010-2986-7

    Article  Google Scholar 

  52. Rajkumar M, Asokan P, Vamsikrishna V (2010) A GRASP algorithm for flexible job-shop scheduling with maintenance constraints. Int J Prod Res 48(22):6821–6836. https://doi.org/10.1080/00207540903308969

    Article  MATH  Google Scholar 

  53. 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. https://doi.org/10.1080/00207541003709544

    Article  Google Scholar 

  54. Sabuncuoglu I, Karapınar HY (1999) Analysis of order review/release problems in production systems. Int J Prod Econ 62(3):259–279. https://doi.org/10.1016/S0925-5273(98)00248-5

    Article  Google Scholar 

  55. Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5–6):563–570. https://doi.org/10.1007/s00170-005-0375-4

    Article  Google Scholar 

  56. Schmidt G (1984) Scheduling on semi-identical processors. Z Oper Res 28(5):153–162. https://doi.org/10.1007/BF01920917

    MathSciNet  Article  MATH  Google Scholar 

  57. Shen XN, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224. https://doi.org/10.1016/j.ins.2014.11.036

    MathSciNet  Article  Google Scholar 

  58. Soto C, Dorronsoro B, Fraire H, Cruz-Reyes L, Gomez-Santillan C, Rangel N (2020) Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evol Comput 53:100632. https://doi.org/10.1016/j.swevo.2019.100632

    Article  Google Scholar 

  59. Sun DH, He W, Zheng LJ, Liao XY (2014) Scheduling flexible job shop problem subject to machine breakdown with game theory. Int J Prod Res 52(13):3858–3876. https://doi.org/10.1080/00207543.2013.784408

    Article  Google Scholar 

  60. Tavakkoli-Moghaddam R, Khalili M, Naderi B (2009) A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Comput 13(10):995. https://doi.org/10.1007/s00500-008-0367-z

    Article  Google Scholar 

  61. Thörnblad K, Strömberg AB, Patriksson M, Almgren T (2015) Scheduling optimisation of a real flexible job shop including fixture availability and preventive maintenance. Eur J Ind Eng 9(1):126–145. https://doi.org/10.1504/EJIE.2015.067451

    Article  Google Scholar 

  62. Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J Sch 6(1):39–62. https://doi.org/10.1023/A:1022235519958

    MathSciNet  Article  MATH  Google Scholar 

  63. Wang YM, Yin HL, Qin KD (2013) A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions. Int J Adv Manuf Technol 68(5–8):1317–1326. https://doi.org/10.1007/s00170-013-4923-z

    Article  Google Scholar 

  64. Wang H, Sheng B, Lu Q et al (2021) A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes. Soft Comput 25(4):2863–2889. https://doi.org/10.1007/s00500-020-05347-z

    Article  Google Scholar 

  65. Xiao L, Song S, Chen X, Coit DW (2016) Joint optimization of production scheduling and machine group preventive maintenance. Reliab Eng Syst Saf 146:68–78. https://doi.org/10.1016/j.ress.2015.10.013

    Article  Google Scholar 

  66. Xing LN, Chen YW, Wang P, Zhao QS, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888–896. https://doi.org/10.1016/j.asoc.2009.10.006

    Article  Google Scholar 

  67. Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37(1):678–687. https://doi.org/10.1016/j.eswa.2009.06.007

    Article  MATH  Google Scholar 

  68. Yuan Y, Xu H, Yang J (2013) A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl Soft Comput 13(7):3259–3272. https://doi.org/10.1016/j.asoc.2013.02.013

    Article  Google Scholar 

  69. Zakaria Z, Petrovic S (2012) Genetic algorithms for match-up rescheduling of the flexible manufacturing systems. Comput Ind Eng 62(2):670–686. https://doi.org/10.1016/j.cie.2011.12.001

    Article  Google Scholar 

  70. Zandieh M, Khatami AR, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449–464. https://doi.org/10.1016/j.asoc.2017.04.060

    Article  Google Scholar 

  71. Zhang S, Wang S (2018) Flexible assembly job-shop scheduling with sequence-dependent setup times and part sharing in a dynamic environment: constraint programming model, mixed-integer programming model, and dispatching rules. IEEE Trans Eng Manag 65(3):487–504. https://doi.org/10.1109/TEM.2017.2785774

    Article  Google Scholar 

  72. 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. https://doi.org/10.1080/00207543.2016.1267414

    Article  Google Scholar 

  73. Zhang L, Li X, Gao L, Zhang G (2016) Dynamic rescheduling in FMS that is simultaneously considering energy consumption and schedule efficiency. Int J Adv Manuf Technol 87(5):1387–1399. https://doi.org/10.1007/s00170-013-4867-3

    Article  Google Scholar 

  74. Zhou Y, Yang JJ, Huang Z (2020) Automatic design of scheduling policies for dynamic flexible job shop scheduling via surrogate-assisted cooperative co-evolution genetic programming. Int J Prod Res 58(9):2561–2580. https://doi.org/10.1080/00207543.2019.1620362

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Adil Baykasoğlu.

Ethics declarations

Conflict of interest

All authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A

In Tables 13, 14 and 15, Event type “1” depicts new order arrival. For instance, a new order J1 arrives at 50th minutes of the schedule. Event type “2” indicates machine breakdown. For example, machine M2 breakdowns at 240th minutes of the schedule and it takes 42 min to fix the machine M2. Event type “3” indicates order cancellation. For instance, eleventh order is cancelled at 550th minutes of the schedule. Event type “4” demonstrates rush order. For instance, the ninth order arrives at 70th minutes of the schedule as rush order. Event type “5” indicates change of due date. For instance, the due date of the eighth order is renewed at 100th minutes of the schedule and the new due date is updated to 2500 min. Setup times are uniformly distributed (8,15). Processing times, which are given in Tables 13, 14 and 15 are uniformly distributed. Capable machine sets of the operations are assigned randomly. Each shift is considered 480 min. Due date of orders are determined by using total work content methodology. The PM operation time and fixed time interval of the PM operation in Tables 13, 14 and 15 are used in the PM policy 1. In the proposed PM policy 2, the earliest beginning time of PM operations for each machine is equal to the fixed time interval value of PM operations and the latest time of PM operations for all machines is considered as 480 min.

Table 13 Data for 5 × 5 DFJSP
Table 14 Data for 10 × 10 DFJSP
Table 15 Data for 15 × 15 DFJSP

Appendix B

See Tables 16 and 17, 18, 19, 20 and 21.

Table 16 Computational results under PM policy 1 for 5 × 5 problems
Table 17 Computational results under PM policy 2 for 5 × 5 problems
Table 18 Computational results under PM policy 1 for 10 × 10 problems
Table 19 Computational results under under PM policy 2 for 10 × 10 problems
Table 20 Computational results under PM policy 1 for 15 × 15 problems
Table 21 Computational results under PM policy 2 for 15 × 15 problems

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Baykasoğlu, A., Madenoğlu, F.S. Greedy randomized adaptive search procedure for simultaneous scheduling of production and preventive maintenance activities in dynamic flexible job shops. Soft Comput 25, 14893–14932 (2021). https://doi.org/10.1007/s00500-021-06053-0

Download citation

Keywords

  • Dynamic flexible job shop scheduling
  • Preventive maintenance policy
  • GRASP
  • Rescheduling