{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:44:56Z","timestamp":1772502296752,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00500-021-06053-0","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T04:02:47Z","timestamp":1627963367000},"page":"14893-14932","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Greedy randomized adaptive search procedure for simultaneous scheduling of production and preventive maintenance activities in dynamic flexible job shops"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4952-7239","authenticated-orcid":false,"given":"Adil","family":"Baykaso\u011flu","sequence":"first","affiliation":[]},{"given":"Fatma S.","family":"Madeno\u011flu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"6053_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","volume":"73","author":"E Ahmadi","year":"2016","unstructured":"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\u201366. https:\/\/doi.org\/10.1016\/j.cor.2016.03.009","journal-title":"Comput Oper Res"},{"issue":"2","key":"6053_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ijpe.2011.04.020","volume":"132","author":"N Al-Hinai","year":"2011","unstructured":"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\u2013291. https:\/\/doi.org\/10.1016\/j.ijpe.2011.04.020","journal-title":"Int J Prod Econ"},{"issue":"4","key":"6053_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"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\u2013541. https:\/\/doi.org\/10.1016\/j.future.2009.10.004","journal-title":"Future Gener Comput Syst"},{"issue":"17","key":"6053_CR4","doi-asserted-by":"publisher","first-page":"4523","DOI":"10.1080\/00207540210147043","volume":"40","author":"A Baykaso\u011flu","year":"2002","unstructured":"Baykaso\u011flu A (2002) Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res 40(17):4523\u20134543. https:\/\/doi.org\/10.1080\/00207540210147043","journal-title":"Int J Prod Res"},{"issue":"1","key":"6053_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0305215042000268606","volume":"37","author":"A Baykaso\u011flu","year":"2005","unstructured":"Baykaso\u011flu A (2005) Preemptive goal programming using simulated annealing. Eng Opt 37(1):49\u201363. https:\/\/doi.org\/10.1080\/0305215042000268606","journal-title":"Eng Opt"},{"issue":"2","key":"6053_CR6","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1080\/00207540903479778","volume":"49","author":"A Baykaso\u011flu","year":"2011","unstructured":"Baykaso\u011flu A, G\u00f6\u00e7ken 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\u2013610. https:\/\/doi.org\/10.1080\/00207540903479778","journal-title":"Int J Prod Res"},{"issue":"11","key":"6053_CR7","doi-asserted-by":"publisher","first-page":"3308","DOI":"10.1080\/00207543.2017.1306134","volume":"55","author":"A Baykaso\u011flu","year":"2017","unstructured":"Baykaso\u011flu A, Karaslan FS (2017) Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach. Int J Prod Res 55(11):3308\u20133325. https:\/\/doi.org\/10.1080\/00207543.2017.1306134","journal-title":"Int J Prod Res"},{"key":"6053_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ins.2017.08.058","volume":"420","author":"A Baykaso\u011flu","year":"2017","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2017) Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization. Inf Sci 420:159\u2013183. https:\/\/doi.org\/10.1016\/j.ins.2017.08.058","journal-title":"Inf Sci"},{"key":"6053_CR9","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.jmsy.2017.12.005","volume":"46","author":"A Baykaso\u011flu","year":"2018","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2018) Dynamic scheduling of parallel heat treatment furnaces: a case study at a manufacturing system. J Manuf Syst 46:152\u2013162. https:\/\/doi.org\/10.1016\/j.jmsy.2017.12.005","journal-title":"J Manuf Syst"},{"key":"6053_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2014.02.056","volume":"276","author":"A Baykasoglu","year":"2014","unstructured":"Baykasoglu A, Hamzadayi A, Kose SY (2014) Testing the performance of teaching\u2013learning based optimization (TLBO) algorithm on combinatorial problems: flow shop and job shop scheduling cases. Inf Sci 276:204\u2013218","journal-title":"Inf Sci"},{"key":"6053_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.jmsy.2020.06.005","volume":"56","author":"A Baykaso\u011flu","year":"2020","unstructured":"Baykaso\u011flu A, Madeno\u011flu FS, Hamzaday\u0131 A (2020) Greedy randomized adaptive search for dynamic flexible job-shop scheduling. J Manuf Syst 56:425\u2013451. https:\/\/doi.org\/10.1016\/j.jmsy.2020.06.005","journal-title":"J Manuf Syst"},{"issue":"3","key":"6053_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01919766","volume":"21","author":"FA Behringer","year":"1977","unstructured":"Behringer FA (1977) Lexicographic quasiconcave multiobjective programming. Z Oper Res 21(3):103\u2013116. https:\/\/doi.org\/10.1007\/BF01919766","journal-title":"Z Oper Res"},{"issue":"15","key":"6053_CR13","doi-asserted-by":"publisher","first-page":"3103","DOI":"10.1080\/00207540500077140","volume":"43","author":"J Branke","year":"2005","unstructured":"Branke J, Mattfeld DC (2005) Anticipation and flexibility in dynamic scheduling. Int J Prod Res 43(15):3103\u20133129. https:\/\/doi.org\/10.1080\/00207540500077140","journal-title":"Int J Prod Res"},{"issue":"3","key":"6053_CR300","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157\u2013183. https:\/\/doi.org\/10.1007\/BF02023073","journal-title":"Ann Oper Res"},{"key":"6053_CR14","doi-asserted-by":"publisher","first-page":"106863","DOI":"10.1016\/j.cie.2020.106863","volume":"149","author":"RH Caldeira","year":"2020","unstructured":"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","journal-title":"Comput Ind Eng"},{"issue":"3","key":"6053_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23(3):551\u2013591. https:\/\/doi.org\/10.1111\/itor.12199","journal-title":"Int Trans Oper Res"},{"issue":"8","key":"6053_CR16","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.1007\/s00500-015-1924-x","volume":"20","author":"J Eaton","year":"2016","unstructured":"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\u20132966. https:\/\/doi.org\/10.1007\/s00500-015-1924-x","journal-title":"Soft Comput"},{"key":"6053_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cie.2016.10.019","volume":"106","author":"F El Khoukhi","year":"2017","unstructured":"El Khoukhi F, Boukachour J, Alaoui AEH (2017) The \u201cdual-ants colony\u201d: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput Ind Eng 106:236\u2013255. https:\/\/doi.org\/10.1016\/j.cie.2016.10.019","journal-title":"Comput Ind Eng"},{"issue":"2","key":"6053_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.cirpj.2009.10.001","volume":"2","author":"P Fattahi","year":"2010","unstructured":"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\u2013123. https:\/\/doi.org\/10.1016\/j.cirpj.2009.10.001","journal-title":"CIRP J Manuf Sci Technol"},{"issue":"2","key":"6053_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109\u2013133. https:\/\/doi.org\/10.1007\/BF01096763","journal-title":"J Glob Optim"},{"issue":"4","key":"6053_CR20","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10845-005-0021-x","volume":"17","author":"J Gao","year":"2006","unstructured":"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\u2013507. https:\/\/doi.org\/10.1007\/s10845-005-0021-x","journal-title":"J Intell Manuf"},{"issue":"21","key":"6053_CR21","doi-asserted-by":"publisher","first-page":"7652","DOI":"10.1016\/j.eswa.2015.06.004","volume":"42","author":"KZ Gao","year":"2015","unstructured":"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\u20137663. https:\/\/doi.org\/10.1016\/j.eswa.2015.06.004","journal-title":"Expert Syst Appl"},{"key":"6053_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2016.06.014","volume":"109","author":"KZ Gao","year":"2016","unstructured":"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\u201316. https:\/\/doi.org\/10.1016\/j.knosys.2016.06.014","journal-title":"Knowl Based Syst"},{"issue":"2","key":"6053_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10845-014-0869-8","volume":"27","author":"KZ Gao","year":"2016","unstructured":"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\u2013374. https:\/\/doi.org\/10.1007\/s10845-014-0869-8","journal-title":"J Intell Manuf"},{"issue":"4","key":"6053_CR24","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"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\u2013916. https:\/\/doi.org\/10.1109\/JAS.2019.1911540","journal-title":"IEEE CAA J Auto Sin"},{"key":"6053_CR25","doi-asserted-by":"publisher","first-page":"105031","DOI":"10.1016\/j.cor.2020.105031","volume":"123","author":"M Ghaleb","year":"2020","unstructured":"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","journal-title":"Comput Oper Res"},{"issue":"4","key":"6053_CR26","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10845-008-0150-0","volume":"20","author":"M Gholami","year":"2009","unstructured":"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","journal-title":"J Intell Manuf"},{"issue":"4","key":"6053_CR27","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487\u2013503. https:\/\/doi.org\/10.1287\/opre.8.4.487","journal-title":"Oper Res"},{"issue":"7","key":"6053_CR28","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1080\/00207543.2017.1388933","volume":"56","author":"X Gong","year":"2018","unstructured":"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\u20132522. https:\/\/doi.org\/10.1080\/00207543.2017.1388933","journal-title":"Int J Prod Res"},{"issue":"1\u20134","key":"6053_CR29","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00170-012-4344-4","volume":"66","author":"W He","year":"2013","unstructured":"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\u20134):501\u2013514. https:\/\/doi.org\/10.1007\/s00170-012-4344-4","journal-title":"Int J Adv Manuf Technol"},{"issue":"8","key":"6053_CR30","doi-asserted-by":"publisher","first-page":"2111","DOI":"10.1007\/s00500-014-1395-5","volume":"19","author":"W Hu","year":"2015","unstructured":"Hu W, Wang H, Peng C, Wang H, Liang H, Du B (2015) An outer\u2013inner fuzzy cellular automata algorithm for dynamic uncertainty multi-project scheduling problem. Soft Comput 19(8):2111\u20132132. https:\/\/doi.org\/10.1007\/s00500-014-1395-5","journal-title":"Soft Comput"},{"issue":"23","key":"6053_CR31","doi-asserted-by":"publisher","first-page":"7021","DOI":"10.1007\/s00500-016-2241-8","volume":"21","author":"XP Ji","year":"2017","unstructured":"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\u20137037. https:\/\/doi.org\/10.1007\/s00500-016-2241-8","journal-title":"Soft Comput"},{"key":"6053_CR32","volume-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques","author":"S Lawrence","year":"1984","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh"},{"issue":"9","key":"6053_CR33","doi-asserted-by":"publisher","first-page":"2896","DOI":"10.1016\/j.asoc.2012.04.012","volume":"12","author":"JQ Li","year":"2012","unstructured":"Li JQ, Pan QK (2012) Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity. Appl Soft Comput 12(9):2896\u20132912. https:\/\/doi.org\/10.1016\/j.asoc.2012.04.012","journal-title":"Appl Soft Comput"},{"issue":"3","key":"6053_CR34","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"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\u20131132. https:\/\/doi.org\/10.1016\/j.apm.2013.07.038","journal-title":"Appl Math Model"},{"key":"6053_CR35","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.cie.2017.09.005","volume":"113","author":"X Li","year":"2017","unstructured":"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\u201326. https:\/\/doi.org\/10.1016\/j.cie.2017.09.005","journal-title":"Comput Ind Eng"},{"key":"6053_CR36","doi-asserted-by":"publisher","first-page":"106544","DOI":"10.1016\/j.asoc.2020.106544","volume":"95","author":"Y Li","year":"2020","unstructured":"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","journal-title":"Appl Soft Comput"},{"key":"6053_CR37","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.procs.2012.09.039","volume":"12","author":"L Lin","year":"2012","unstructured":"Lin L, Gen M, Liang Y, Ohno K (2012) A hybrid EA for reactive flexible job-shop scheduling. Procedia Comput Sci 12:110\u2013115. https:\/\/doi.org\/10.1016\/j.procs.2012.09.039","journal-title":"Procedia Comput Sci"},{"key":"6053_CR38","doi-asserted-by":"publisher","first-page":"106208","DOI":"10.1016\/j.asoc.2020.106208","volume":"91","author":"S Luo","year":"2020","unstructured":"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","journal-title":"Appl Soft Comput"},{"key":"6053_CR39","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1790686","author":"B Mihoubi","year":"2020","unstructured":"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","journal-title":"Int J Prod Res"},{"issue":"2","key":"6053_CR40","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00500-003-0352-5","volume":"9","author":"M Moustafa","year":"2005","unstructured":"Moustafa M, Habib I, Naghshineh M (2005) GAME based dynamic resource scheduling in QoS aware radio access networks. Soft Comput 9(2):101\u2013115. https:\/\/doi.org\/10.1007\/s00500-003-0352-5","journal-title":"Soft Comput"},{"issue":"4","key":"6053_CR41","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","volume":"24","author":"L Nie","year":"2013","unstructured":"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\u2013774. https:\/\/doi.org\/10.1007\/s10845-012-0626-9","journal-title":"J Intell Manuf"},{"issue":"5","key":"6053_CR42","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s12652-016-0370-7","volume":"7","author":"T Ning","year":"2016","unstructured":"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\u2013729. https:\/\/doi.org\/10.1007\/s12652-016-0370-7","journal-title":"J Ambient Intell Hum Comput"},{"key":"6053_CR43","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.cie.2017.03.006","volume":"112","author":"M Nouiri","year":"2017","unstructured":"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\u2013606. https:\/\/doi.org\/10.1016\/j.cie.2017.03.006","journal-title":"Comput Ind Eng"},{"issue":"3","key":"6053_CR44","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","volume":"29","author":"M Nouiri","year":"2018","unstructured":"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\u2013615. https:\/\/doi.org\/10.1007\/s10845-015-1039-3","journal-title":"J Intell Manuf"},{"issue":"10","key":"6053_CR45","doi-asserted-by":"publisher","first-page":"3121","DOI":"10.1080\/00207543.2018.1543964","volume":"57","author":"G Ozturk","year":"2019","unstructured":"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\u20133137. https:\/\/doi.org\/10.1080\/00207543.2018.1543964","journal-title":"Int J Prod Res"},{"issue":"10","key":"6053_CR46","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202\u20133212. https:\/\/doi.org\/10.1016\/j.cor.2007.02.014","journal-title":"Comput Oper Res"},{"issue":"1","key":"6053_CR47","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1111\/j.1540-5915.1988.tb00260.x","volume":"19","author":"GL Ragatz","year":"1988","unstructured":"Ragatz GL, Mabert VA (1988) An evaluation of order release mechanisms in a job-shop environment. Dec Sci 19(1):167\u2013189. https:\/\/doi.org\/10.1111\/j.1540-5915.1988.tb00260.x","journal-title":"Dec Sci"},{"issue":"9","key":"6053_CR48","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1007\/s00170-011-3437-9","volume":"58","author":"SHA Rahmati","year":"2012","unstructured":"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\u20131129. https:\/\/doi.org\/10.1007\/s00170-011-3437-9","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"6053_CR49","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10479-017-2594-0","volume":"269","author":"SHA Rahmati","year":"2018","unstructured":"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\u2013621. https:\/\/doi.org\/10.1007\/s10479-017-2594-0","journal-title":"Ann Oper Res"},{"issue":"9\u201312","key":"6053_CR50","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s00170-010-2986-7","volume":"54","author":"A Rajabinasab","year":"2011","unstructured":"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\u201312):1091\u20131107. https:\/\/doi.org\/10.1007\/s00170-010-2986-7","journal-title":"Int J Adv Manuf Technol"},{"issue":"22","key":"6053_CR51","doi-asserted-by":"publisher","first-page":"6821","DOI":"10.1080\/00207540903308969","volume":"48","author":"M Rajkumar","year":"2010","unstructured":"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\u20136836. https:\/\/doi.org\/10.1080\/00207540903308969","journal-title":"Int J Prod Res"},{"issue":"8","key":"6053_CR52","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1080\/00207541003709544","volume":"49","author":"M Rajkumar","year":"2011","unstructured":"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\u20132423. https:\/\/doi.org\/10.1080\/00207541003709544","journal-title":"Int J Prod Res"},{"issue":"3","key":"6053_CR53","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0925-5273(98)00248-5","volume":"62","author":"I Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu I, Karap\u0131nar HY (1999) Analysis of order review\/release problems in production systems. Int J Prod Econ 62(3):259\u2013279. https:\/\/doi.org\/10.1016\/S0925-5273(98)00248-5","journal-title":"Int J Prod Econ"},{"issue":"5\u20136","key":"6053_CR54","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5\u20136):563\u2013570. https:\/\/doi.org\/10.1007\/s00170-005-0375-4","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"6053_CR55","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01920917","volume":"28","author":"G Schmidt","year":"1984","unstructured":"Schmidt G (1984) Scheduling on semi-identical processors. Z Oper Res 28(5):153\u2013162. https:\/\/doi.org\/10.1007\/BF01920917","journal-title":"Z Oper Res"},{"key":"6053_CR56","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ins.2014.11.036","volume":"298","author":"XN Shen","year":"2015","unstructured":"Shen XN, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198\u2013224. https:\/\/doi.org\/10.1016\/j.ins.2014.11.036","journal-title":"Inf Sci"},{"key":"6053_CR57","doi-asserted-by":"publisher","first-page":"100632","DOI":"10.1016\/j.swevo.2019.100632","volume":"53","author":"C Soto","year":"2020","unstructured":"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","journal-title":"Swarm Evol Comput"},{"issue":"13","key":"6053_CR58","doi-asserted-by":"publisher","first-page":"3858","DOI":"10.1080\/00207543.2013.784408","volume":"52","author":"DH Sun","year":"2014","unstructured":"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\u20133876. https:\/\/doi.org\/10.1080\/00207543.2013.784408","journal-title":"Int J Prod Res"},{"issue":"10","key":"6053_CR59","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s00500-008-0367-z","volume":"13","author":"R Tavakkoli-Moghaddam","year":"2009","unstructured":"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","journal-title":"Soft Comput"},{"issue":"1","key":"6053_CR60","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1504\/EJIE.2015.067451","volume":"9","author":"K Th\u00f6rnblad","year":"2015","unstructured":"Th\u00f6rnblad K, Str\u00f6mberg 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\u2013145. https:\/\/doi.org\/10.1504\/EJIE.2015.067451","journal-title":"Eur J Ind Eng"},{"issue":"1","key":"6053_CR61","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1022235519958","volume":"6","author":"GE Vieira","year":"2003","unstructured":"Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J Sch 6(1):39\u201362. https:\/\/doi.org\/10.1023\/A:1022235519958","journal-title":"J Sch"},{"issue":"5\u20138","key":"6053_CR62","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1007\/s00170-013-4923-z","volume":"68","author":"YM Wang","year":"2013","unstructured":"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\u20138):1317\u20131326. https:\/\/doi.org\/10.1007\/s00170-013-4923-z","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"6053_CR63","doi-asserted-by":"publisher","first-page":"2863","DOI":"10.1007\/s00500-020-05347-z","volume":"25","author":"H Wang","year":"2021","unstructured":"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\u20132889. https:\/\/doi.org\/10.1007\/s00500-020-05347-z","journal-title":"Soft Comput"},{"key":"6053_CR64","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ress.2015.10.013","volume":"146","author":"L Xiao","year":"2016","unstructured":"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\u201378. https:\/\/doi.org\/10.1016\/j.ress.2015.10.013","journal-title":"Reliab Eng Syst Saf"},{"issue":"3","key":"6053_CR65","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"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\u2013896. https:\/\/doi.org\/10.1016\/j.asoc.2009.10.006","journal-title":"Appl Soft Comput"},{"issue":"1","key":"6053_CR66","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","volume":"37","author":"M Yazdani","year":"2010","unstructured":"Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37(1):678\u2013687. https:\/\/doi.org\/10.1016\/j.eswa.2009.06.007","journal-title":"Expert Syst Appl"},{"issue":"7","key":"6053_CR67","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","volume":"13","author":"Y Yuan","year":"2013","unstructured":"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\u20133272. https:\/\/doi.org\/10.1016\/j.asoc.2013.02.013","journal-title":"Appl Soft Comput"},{"issue":"2","key":"6053_CR68","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.cie.2011.12.001","volume":"62","author":"Z Zakaria","year":"2012","unstructured":"Zakaria Z, Petrovic S (2012) Genetic algorithms for match-up rescheduling of the flexible manufacturing systems. Comput Ind Eng 62(2):670\u2013686. https:\/\/doi.org\/10.1016\/j.cie.2011.12.001","journal-title":"Comput Ind Eng"},{"key":"6053_CR69","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.asoc.2017.04.060","volume":"58","author":"M Zandieh","year":"2017","unstructured":"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\u2013464. https:\/\/doi.org\/10.1016\/j.asoc.2017.04.060","journal-title":"Appl Soft Comput"},{"issue":"3","key":"6053_CR70","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1109\/TEM.2017.2785774","volume":"65","author":"S Zhang","year":"2018","unstructured":"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\u2013504. https:\/\/doi.org\/10.1109\/TEM.2017.2785774","journal-title":"IEEE Trans Eng Manag"},{"issue":"11","key":"6053_CR71","doi-asserted-by":"publisher","first-page":"3173","DOI":"10.1080\/00207543.2016.1267414","volume":"55","author":"S Zhang","year":"2017","unstructured":"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\u20133196. https:\/\/doi.org\/10.1080\/00207543.2016.1267414","journal-title":"Int J Prod Res"},{"issue":"5","key":"6053_CR72","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s00170-013-4867-3","volume":"87","author":"L Zhang","year":"2016","unstructured":"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\u20131399. https:\/\/doi.org\/10.1007\/s00170-013-4867-3","journal-title":"Int J Adv Manuf Technol"},{"issue":"9","key":"6053_CR73","doi-asserted-by":"publisher","first-page":"2561","DOI":"10.1080\/00207543.2019.1620362","volume":"58","author":"Y Zhou","year":"2020","unstructured":"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\u20132580. https:\/\/doi.org\/10.1080\/00207543.2019.1620362","journal-title":"Int J Prod Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06053-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06053-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06053-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T18:13:54Z","timestamp":1635185634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06053-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":74,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["6053"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06053-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"assertion":[{"value":"17 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}