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

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 necessitate...

Full description

Saved in:

Bibliographic Details
Published in:	Soft computing (Berlin, Germany) Vol. 25; no. 23; pp. 14893 - 14932
Main Authors:	Baykasoğlu, Adil, Madenoğlu, Fatma S.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2021
Subjects:	Application of Soft Computing Artificial Intelligence Computational Intelligence Control Engineering Mathematical Logic and Foundations Mechatronics Robotics Preventive maintenance policy Rescheduling Dynamic flexible job shop scheduling GRASP
ISSN:	1432-7643, 1433-7479
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

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.
AbstractList	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.
Author	Baykasoğlu, Adil Madenoğlu, Fatma S.
Author_xml	– sequence: 1 givenname: Adil orcidid: 0000-0002-4952-7239 surname: Baykasoğlu fullname: Baykasoğlu, Adil email: adil.baykasoglu@deu.edu.tr organization: Department of Industrial Engineering, Faculty of Engineering, Dokuz Eylül University – sequence: 2 givenname: Fatma S. surname: Madenoğlu fullname: Madenoğlu, Fatma S. organization: Department of Management Science, Abdullah Gul University
BookMark	eNp9kE1OwzAQhS0EEr8XYOULBCZxYjdLhPiTKrGBdTS1x9RVYld2UlFuwm1xW1YsWM2M5n1vNO-cHfvgibHrEm5KAHWbABqAAqqyAAmNKOCInZW1EIWqVXu876tCyVqcsvOUVpCVqhFn7PspEpktj-hNGNwXGY4G16PbEE-EUS_5OgZNZorEbYg8uWHqR_QUpsSTXuZN7_wHD3YnNJMeXfA8u-WRNuT3TgM6P5JHr4ljVmzc6Chx57nZehyc5ranT7foia_CgqdlWKdLdmKxT3T1Wy_Y--PD2_1zMX99erm_mxe6asuxkJUWGlSNGhezstLKQKMWjdEN2Ralsq2AUlKtjWiEaFsljbUzqcHIVioU4oJVB18dQ0qRbLeObsC47UroduF2h3C7HFm3D7eDDM3-QNqNuHt9jOj6_1FxQFO-4z8odqswRZ9f_I_6Afx4lZo
CitedBy_id	crossref_primary_10_1080_00207543_2023_2294114 crossref_primary_10_1007_s10845_023_02114_3 crossref_primary_10_1016_j_dajour_2025_100585 crossref_primary_10_1177_09544054241289976 crossref_primary_10_1177_1748006X231205185 crossref_primary_10_1016_j_ifacol_2022_09_557 crossref_primary_10_1016_j_asoc_2024_112276 crossref_primary_10_1007_s10489_023_04479_7 crossref_primary_10_1016_j_eswa_2022_118711 crossref_primary_10_1007_s12555_023_0578_1 crossref_primary_10_1016_j_engappai_2025_111126 crossref_primary_10_1080_00207543_2025_2533528 crossref_primary_10_1016_j_asoc_2025_113815 crossref_primary_10_1016_j_jmsy_2024_01_011 crossref_primary_10_1080_0951192X_2025_2511105 crossref_primary_10_1016_j_engappai_2025_110638 crossref_primary_10_1109_TAES_2022_3211247 crossref_primary_10_1007_s42524_022_0218_0 crossref_primary_10_1016_j_cie_2023_109111
Cites_doi	10.1016/j.jmsy.2017.12.005 10.1111/j.1540-5915.1988.tb00260.x 10.1007/s00500-016-2241-8 10.1007/s00500-008-0367-z 10.1023/A:1022235519958 10.1007/s10845-005-0021-x 10.1016/j.cie.2017.09.005 10.1080/00207543.2017.1306134 10.1016/j.ins.2017.08.058 10.1007/s10845-012-0626-9 10.1007/s00170-010-2986-7 10.1016/j.cirpj.2009.10.001 10.1016/j.ins.2014.02.056 10.1016/j.cie.2016.10.019 10.1504/EJIE.2015.067451 10.1080/00207543.2017.1388933 10.1007/s00500-014-1395-5 10.1007/s00500-020-05347-z 10.1016/j.cor.2020.105031 10.1007/s00500-003-0352-5 10.1016/j.jmsy.2020.06.005 10.1007/s12652-016-0370-7 10.1016/j.asoc.2020.106544 10.1016/j.ins.2014.11.036 10.1080/00207540903308969 10.1080/00207543.2016.1267414 10.1007/s00170-013-4867-3 10.1016/j.cor.2007.02.014 10.1016/j.asoc.2017.04.060 10.1080/0305215042000268606 10.1007/BF01096763 10.1007/s10845-008-0150-0 10.1016/j.eswa.2009.06.007 10.1109/TEM.2017.2785774 10.1016/j.asoc.2009.10.006 10.1007/s10479-017-2594-0 10.1080/00207543.2013.784408 10.1007/s10845-014-0869-8 10.1016/S0925-5273(98)00248-5 10.1016/j.swevo.2019.100632 10.1080/00207540210147043 10.1007/s00170-012-4344-4 10.1007/s00170-005-0375-4 10.1016/j.cie.2020.106863 10.1007/s10845-015-1039-3 10.1287/opre.8.4.487 10.1016/j.asoc.2012.04.012 10.1016/j.procs.2012.09.039 10.1080/00207541003709544 10.1016/j.future.2009.10.004 10.1007/s00500-015-1924-x 10.1016/j.cor.2016.03.009 10.1016/j.knosys.2016.06.014 10.1016/j.apm.2013.07.038 10.1016/j.asoc.2020.106208 10.1007/BF01920917 10.1080/00207540500077140 10.1016/j.asoc.2013.02.013 10.1111/itor.12199 10.1080/00207543.2019.1620362 10.1016/j.ress.2015.10.013 10.1007/BF01919766 10.1007/BF02023073 10.1016/j.cie.2011.12.001 10.1016/j.eswa.2015.06.004 10.1016/j.ijpe.2011.04.020 10.1007/s00170-013-4923-z 10.1007/s00170-011-3437-9 10.1080/00207543.2018.1543964 10.1080/00207540903479778 10.1080/00207543.2020.1790686 10.1016/j.cie.2017.03.006 10.1109/JAS.2019.1911540
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021
DBID	AAYXX CITATION
DOI	10.1007/s00500-021-06053-0
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1433-7479
EndPage	14932
ExternalDocumentID	10_1007_s00500_021_06053_0
GroupedDBID	-5B -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 1SB 203 29~ 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV LAS LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9P PF0 PT4 PT5 QOS R89 R9I RIG RNI ROL RPX RSV RZK S16 S1Z S27 S3B SAP SDH SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Y Z7Z Z81 Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB
ID	FETCH-LOGICAL-c291t-62c3c074acab812c7d057b5dc5ef9a67f93016e4cd35339976dff86c0d6967a33
IEDL.DBID	RSV
ISICitedReferencesCount	24
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000680819800008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1432-7643
IngestDate	Sat Nov 29 03:36:11 EST 2025 Tue Nov 18 22:13:20 EST 2025 Fri Feb 21 02:47:23 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	23
Keywords	Preventive maintenance policy Rescheduling Dynamic flexible job shop scheduling GRASP
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c291t-62c3c074acab812c7d057b5dc5ef9a67f93016e4cd35339976dff86c0d6967a33
ORCID	0000-0002-4952-7239
PageCount	40
ParticipantIDs	crossref_primary_10_1007_s00500_021_06053_0 crossref_citationtrail_10_1007_s00500_021_06053_0 springer_journals_10_1007_s00500_021_06053_0
PublicationCentury	2000
PublicationDate	20211200 2021-12-00
PublicationDateYYYYMMDD	2021-12-01
PublicationDate_xml	– month: 12 year: 2021 text: 20211200
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg
PublicationSubtitle	A Fusion of Foundations, Methodologies and Applications
PublicationTitle	Soft computing (Berlin, Germany)
PublicationTitleAbbrev	Soft Comput
PublicationYear	2021
Publisher	Springer Berlin Heidelberg
Publisher_xml	– name: Springer Berlin Heidelberg
References	Soto, Dorronsoro, Fraire, Cruz-Reyes, Gomez-Santillan, Rangel (CR57) 2020; 53 Brandimarte (CR300) 1993; 41 El Khoukhi, Boukachour, Alaoui (CR17) 2017; 106 Rajkumar, Asokan, Anilkumar, Page (CR52) 2011; 49 Li, Pan, Tasgetiren (CR34) 2014; 38 Wang, Yin, Qin (CR62) 2013; 68 Feo, Resende (CR19) 1995; 6 Ahmadi, Zandieh, Farrokh, Emami (CR1) 2016; 73 Zhang, Wong (CR71) 2017; 55 Hu, Wang, Peng, Wang, Liang, Du (CR30) 2015; 19 Rajabinasab, Mansour (CR50) 2011; 54 Ragatz, Mabert (CR47) 1988; 19 Lin, Gen, Liang, Ohno (CR37) 2012; 12 Behringer (CR12) 1977; 21 Baykasoğlu, Madenoğlu, Hamzadayı (CR11) 2020; 56 Gao, Suganthan, Chua, Chong, Cai, Pan (CR21) 2015; 42 Wang, Sheng, Lu (CR63) 2021; 25 Xiao, Song, Chen, Coit (CR64) 2016; 146 Ji, Cao, Du, Tang (CR31) 2017; 21 Ghaleb, Zolfagharinia, Taghipour (CR25) 2020; 123 Sun, He, Zheng, Liao (CR58) 2014; 52 Yuan, Xu, Yang (CR67) 2013; 13 Baykasoglu, Hamzadayi, Kose (CR10) 2014; 276 Rahmati, Zandieh (CR48) 2012; 58 Gholami, Zandieh (CR26) 2009; 20 Baykasoğlu, Göçken (CR6) 2011; 49 Baykasoğlu, Ozsoydan (CR9) 2018; 46 He, Sun (CR29) 2013; 66 Vieira, Herrmann, Lin (CR61) 2003; 6 Gao, Suganthan, Pan, Tasgetiren, Sadollah (CR22) 2016; 109 Baykasoğlu (CR4) 2002; 40 Zhang, Li, Gao, Zhang (CR72) 2016; 87 Eaton, Yang, Mavrovouniotis (CR16) 2016; 20 Saidi-Mehrabad, Fattahi (CR54) 2007; 32 Thörnblad, Strömberg, Patriksson, Almgren (CR60) 2015; 9 Caldeira, Gnanavelbabu, Vaidyanathan (CR14) 2020; 149 Li, Huang, Wu, Guo (CR36) 2020; 95 Schmidt (CR55) 1984; 28 Al-Hinai, ElMekkawy (CR2) 2011; 132 Zhou, Yang, Huang (CR73) 2020; 58 Branke, Mattfeld (CR13) 2005; 43 Gao, Suganthan, Pan, Chua, Cai, Chong (CR23) 2016; 27 Luo (CR38) 2020; 91 Ning, Huang, Liang, Jin (CR42) 2016; 7 Moustafa, Habib, Naghshineh (CR40) 2005; 9 Nouiri, Bekrar, Jemai, Trentesaux, Ammari, Niar (CR43) 2017; 112 Bagheri, Zandieh, Mahdavi, Yazdani (CR3) 2010; 26 Giffler, Thompson (CR27) 1960; 8 Shen, Yao (CR56) 2015; 298 Rajkumar, Asokan, Vamsikrishna (CR51) 2010; 48 Baykasoğlu, Ozsoydan (CR8) 2017; 420 Lawrence (CR32) 1984 Mihoubi, Bouzouia, Gaham (CR39) 2020 Li, Peng, Du, Guo, Xu, Zhuang (CR35) 2017; 113 Yazdani, Amiri, Zandieh (CR66) 2010; 37 Gao, Cao, Zhang, Chen, Han, Pan (CR24) 2019; 6 Rahmati, Ahmadi, Govindan (CR49) 2018; 269 Baykasoğlu (CR5) 2005; 37 Chaudhry, Khan (CR15) 2016; 23 Ozturk, Bahadir, Teymourifar (CR45) 2019; 57 Gong, Deng, Gong, Liu, Ren (CR28) 2018; 56 Baykasoğlu, Karaslan (CR7) 2017; 55 Zhang, Wang (CR70) 2018; 65 Gao, Gen, Sun (CR20) 2006; 17 Sabuncuoglu, Karapınar (CR53) 1999; 62 Li, Pan (CR33) 2012; 12 Pezzella, Morganti, Ciaschetti (CR46) 2008; 35 Zakaria, Petrovic (CR68) 2012; 62 Nie, Gao, Li, Li (CR41) 2013; 24 Zandieh, Khatami, Rahmati (CR69) 2017; 58 Fattahi, Fallahi (CR18) 2010; 2 Nouiri, Bekrar, Jemai, Niar, Ammari (CR44) 2018; 29 Tavakkoli-Moghaddam, Khalili, Naderi (CR59) 2009; 13 Xing, Chen, Wang, Zhao, Xiong (CR65) 2010; 10 A Baykasoğlu (6053_CR9) 2018; 46 S Lawrence (6053_CR32) 1984 A Baykasoğlu (6053_CR8) 2017; 420 M Nouiri (6053_CR43) 2017; 112 J Gao (6053_CR20) 2006; 17 L Zhang (6053_CR72) 2016; 87 L Nie (6053_CR41) 2013; 24 FA Behringer (6053_CR12) 1977; 21 YM Wang (6053_CR62) 2013; 68 A Baykasoğlu (6053_CR4) 2002; 40 F El Khoukhi (6053_CR17) 2017; 106 RH Caldeira (6053_CR14) 2020; 149 A Baykasoğlu (6053_CR7) 2017; 55 LN Xing (6053_CR65) 2010; 10 L Lin (6053_CR37) 2012; 12 DH Sun (6053_CR58) 2014; 52 GL Ragatz (6053_CR47) 1988; 19 M Nouiri (6053_CR44) 2018; 29 M Rajkumar (6053_CR51) 2010; 48 F Pezzella (6053_CR46) 2008; 35 C Soto (6053_CR57) 2020; 53 J Branke (6053_CR13) 2005; 43 M Ghaleb (6053_CR25) 2020; 123 P Fattahi (6053_CR18) 2010; 2 X Gong (6053_CR28) 2018; 56 IA Chaudhry (6053_CR15) 2016; 23 A Baykasoğlu (6053_CR6) 2011; 49 K Gao (6053_CR24) 2019; 6 L Xiao (6053_CR64) 2016; 146 Y Zhou (6053_CR73) 2020; 58 KZ Gao (6053_CR22) 2016; 109 KZ Gao (6053_CR23) 2016; 27 G Schmidt (6053_CR55) 1984; 28 M Moustafa (6053_CR40) 2005; 9 G Ozturk (6053_CR45) 2019; 57 XP Ji (6053_CR31) 2017; 21 GE Vieira (6053_CR61) 2003; 6 SHA Rahmati (6053_CR49) 2018; 269 Z Zakaria (6053_CR68) 2012; 62 X Li (6053_CR35) 2017; 113 A Rajabinasab (6053_CR50) 2011; 54 A Baykasoğlu (6053_CR11) 2020; 56 A Baykasoglu (6053_CR10) 2014; 276 M Yazdani (6053_CR66) 2010; 37 Y Li (6053_CR36) 2020; 95 M Zandieh (6053_CR69) 2017; 58 R Tavakkoli-Moghaddam (6053_CR59) 2009; 13 A Baykasoğlu (6053_CR5) 2005; 37 XN Shen (6053_CR56) 2015; 298 W He (6053_CR29) 2013; 66 S Zhang (6053_CR71) 2017; 55 TA Feo (6053_CR19) 1995; 6 S Luo (6053_CR38) 2020; 91 B Mihoubi (6053_CR39) 2020 A Bagheri (6053_CR3) 2010; 26 N Al-Hinai (6053_CR2) 2011; 132 M Rajkumar (6053_CR52) 2011; 49 M Gholami (6053_CR26) 2009; 20 T Ning (6053_CR42) 2016; 7 SHA Rahmati (6053_CR48) 2012; 58 Y Yuan (6053_CR67) 2013; 13 J Eaton (6053_CR16) 2016; 20 W Hu (6053_CR30) 2015; 19 KZ Gao (6053_CR21) 2015; 42 P Brandimarte (6053_CR300) 1993; 41 JQ Li (6053_CR33) 2012; 12 B Giffler (6053_CR27) 1960; 8 I Sabuncuoglu (6053_CR53) 1999; 62 S Zhang (6053_CR70) 2018; 65 JQ Li (6053_CR34) 2014; 38 E Ahmadi (6053_CR1) 2016; 73 K Thörnblad (6053_CR60) 2015; 9 M Saidi-Mehrabad (6053_CR54) 2007; 32 H Wang (6053_CR63) 2021; 25
References_xml	– volume: 46 start-page: 152 year: 2018 end-page: 162 ident: CR9 article-title: Dynamic scheduling of parallel heat treatment furnaces: a case study at a manufacturing system publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2017.12.005 – volume: 19 start-page: 167 issue: 1 year: 1988 end-page: 189 ident: CR47 article-title: An evaluation of order release mechanisms in a job-shop environment publication-title: Dec Sci doi: 10.1111/j.1540-5915.1988.tb00260.x – volume: 21 start-page: 7021 issue: 23 year: 2017 end-page: 7037 ident: CR31 article-title: An evolutionary approach for dynamic single-runway arrival sequencing and scheduling problem publication-title: Soft Comput doi: 10.1007/s00500-016-2241-8 – volume: 13 start-page: 995 issue: 10 year: 2009 ident: CR59 article-title: 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 publication-title: Soft Comput doi: 10.1007/s00500-008-0367-z – volume: 6 start-page: 39 issue: 1 year: 2003 end-page: 62 ident: CR61 article-title: Rescheduling manufacturing systems: a framework of strategies, policies, and methods publication-title: J Sch doi: 10.1023/A:1022235519958 – volume: 17 start-page: 493 issue: 4 year: 2006 end-page: 507 ident: CR20 article-title: Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm publication-title: J Intell Manuf doi: 10.1007/s10845-005-0021-x – volume: 113 start-page: 10 year: 2017 end-page: 26 ident: CR35 article-title: Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.09.005 – volume: 55 start-page: 3308 issue: 11 year: 2017 end-page: 3325 ident: CR7 article-title: Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1306134 – volume: 420 start-page: 159 year: 2017 end-page: 183 ident: CR8 article-title: Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization publication-title: Inf Sci doi: 10.1016/j.ins.2017.08.058 – volume: 24 start-page: 763 issue: 4 year: 2013 end-page: 774 ident: CR41 article-title: A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates publication-title: J Intell Manuf doi: 10.1007/s10845-012-0626-9 – volume: 54 start-page: 1091 issue: 9–12 year: 2011 end-page: 1107 ident: CR50 article-title: Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-010-2986-7 – volume: 2 start-page: 114 issue: 2 year: 2010 end-page: 123 ident: CR18 article-title: Dynamic scheduling in flexible job s hop systems by considering simultaneously efficiency and stability publication-title: CIRP J Manuf Sci Technol doi: 10.1016/j.cirpj.2009.10.001 – volume: 276 start-page: 204 year: 2014 end-page: 218 ident: CR10 article-title: Testing the performance of teaching–learning based optimization (TLBO) algorithm on combinatorial problems: flow shop and job shop scheduling cases publication-title: Inf Sci doi: 10.1016/j.ins.2014.02.056 – volume: 106 start-page: 236 year: 2017 end-page: 255 ident: CR17 article-title: The “dual-ants colony”: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance publication-title: Comput Ind Eng doi: 10.1016/j.cie.2016.10.019 – volume: 9 start-page: 126 issue: 1 year: 2015 end-page: 145 ident: CR60 article-title: Scheduling optimisation of a real flexible job shop including fixture availability and preventive maintenance publication-title: Eur J Ind Eng doi: 10.1504/EJIE.2015.067451 – volume: 56 start-page: 2506 issue: 7 year: 2018 end-page: 2522 ident: CR28 article-title: A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1388933 – volume: 19 start-page: 2111 issue: 8 year: 2015 end-page: 2132 ident: CR30 article-title: An outer–inner fuzzy cellular automata algorithm for dynamic uncertainty multi-project scheduling problem publication-title: Soft Comput doi: 10.1007/s00500-014-1395-5 – volume: 25 start-page: 2863 issue: 4 year: 2021 end-page: 2889 ident: CR63 article-title: A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes publication-title: Soft Comput doi: 10.1007/s00500-020-05347-z – volume: 123 start-page: 105031 year: 2020 ident: CR25 article-title: Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns publication-title: Comput Oper Res doi: 10.1016/j.cor.2020.105031 – volume: 9 start-page: 101 issue: 2 year: 2005 end-page: 115 ident: CR40 article-title: GAME based dynamic resource scheduling in QoS aware radio access networks publication-title: Soft Comput doi: 10.1007/s00500-003-0352-5 – volume: 56 start-page: 425 year: 2020 end-page: 451 ident: CR11 article-title: Greedy randomized adaptive search for dynamic flexible job-shop scheduling publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2020.06.005 – volume: 7 start-page: 721 issue: 5 year: 2016 end-page: 729 ident: CR42 article-title: A novel dynamic scheduling strategy for solving flexible job-shop problems publication-title: J Ambient Intell Hum Comput doi: 10.1007/s12652-016-0370-7 – volume: 95 start-page: 106544 year: 2020 ident: CR36 article-title: An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106544 – volume: 298 start-page: 198 year: 2015 end-page: 224 ident: CR56 article-title: Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems publication-title: Inf Sci doi: 10.1016/j.ins.2014.11.036 – volume: 48 start-page: 6821 issue: 22 year: 2010 end-page: 6836 ident: CR51 article-title: A GRASP algorithm for flexible job-shop scheduling with maintenance constraints publication-title: Int J Prod Res doi: 10.1080/00207540903308969 – volume: 55 start-page: 3173 issue: 11 year: 2017 end-page: 3196 ident: CR71 article-title: Flexible job-shop scheduling/rescheduling in dynamic environment: a hybrid MAS/ACO approach publication-title: Int J Prod Res doi: 10.1080/00207543.2016.1267414 – volume: 87 start-page: 1387 issue: 5 year: 2016 end-page: 1399 ident: CR72 article-title: Dynamic rescheduling in FMS that is simultaneously considering energy consumption and schedule efficiency publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-013-4867-3 – volume: 35 start-page: 3202 issue: 10 year: 2008 end-page: 3212 ident: CR46 article-title: A genetic algorithm for the flexible job-shop scheduling problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2007.02.014 – volume: 58 start-page: 449 year: 2017 end-page: 464 ident: CR69 article-title: Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2017.04.060 – volume: 37 start-page: 49 issue: 1 year: 2005 end-page: 63 ident: CR5 article-title: Preemptive goal programming using simulated annealing publication-title: Eng Opt doi: 10.1080/0305215042000268606 – volume: 6 start-page: 109 issue: 2 year: 1995 end-page: 133 ident: CR19 article-title: Greedy randomized adaptive search procedures publication-title: J Glob Optim doi: 10.1007/BF01096763 – volume: 20 start-page: 481 issue: 4 year: 2009 ident: CR26 article-title: Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop publication-title: J Intell Manuf doi: 10.1007/s10845-008-0150-0 – year: 1984 ident: CR32 publication-title: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques – volume: 37 start-page: 678 issue: 1 year: 2010 end-page: 687 ident: CR66 article-title: Flexible job-shop scheduling with parallel variable neighborhood search algorithm publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2009.06.007 – volume: 65 start-page: 487 issue: 3 year: 2018 end-page: 504 ident: CR70 article-title: 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 publication-title: IEEE Trans Eng Manag doi: 10.1109/TEM.2017.2785774 – volume: 10 start-page: 888 issue: 3 year: 2010 end-page: 896 ident: CR65 article-title: A knowledge-based ant colony optimization for flexible job shop scheduling problems publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2009.10.006 – volume: 269 start-page: 583 issue: 1 year: 2018 end-page: 621 ident: CR49 article-title: A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach publication-title: Ann Oper Res doi: 10.1007/s10479-017-2594-0 – volume: 52 start-page: 3858 issue: 13 year: 2014 end-page: 3876 ident: CR58 article-title: Scheduling flexible job shop problem subject to machine breakdown with game theory publication-title: Int J Prod Res doi: 10.1080/00207543.2013.784408 – volume: 27 start-page: 363 issue: 2 year: 2016 end-page: 374 ident: CR23 article-title: Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives publication-title: J Intell Manuf doi: 10.1007/s10845-014-0869-8 – volume: 62 start-page: 259 issue: 3 year: 1999 end-page: 279 ident: CR53 article-title: Analysis of order review/release problems in production systems publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(98)00248-5 – volume: 53 start-page: 100632 year: 2020 ident: CR57 article-title: Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm publication-title: Swarm Evol Comput doi: 10.1016/j.swevo.2019.100632 – volume: 40 start-page: 4523 issue: 17 year: 2002 end-page: 4543 ident: CR4 article-title: Linguistic-based meta-heuristic optimization model for flexible job shop scheduling publication-title: Int J Prod Res doi: 10.1080/00207540210147043 – volume: 66 start-page: 501 issue: 1–4 year: 2013 end-page: 514 ident: CR29 article-title: Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-012-4344-4 – volume: 32 start-page: 563 issue: 5–6 year: 2007 end-page: 570 ident: CR54 article-title: Flexible job shop scheduling with tabu search algorithms publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-005-0375-4 – volume: 149 start-page: 106863 year: 2020 ident: CR14 article-title: An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption publication-title: Comput Ind Eng doi: 10.1016/j.cie.2020.106863 – volume: 29 start-page: 603 issue: 3 year: 2018 end-page: 615 ident: CR44 article-title: An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem publication-title: J Intell Manuf doi: 10.1007/s10845-015-1039-3 – volume: 8 start-page: 487 issue: 4 year: 1960 end-page: 503 ident: CR27 article-title: Algorithms for solving production-scheduling problems publication-title: Oper Res doi: 10.1287/opre.8.4.487 – volume: 12 start-page: 2896 issue: 9 year: 2012 end-page: 2912 ident: CR33 article-title: Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2012.04.012 – volume: 12 start-page: 110 year: 2012 end-page: 115 ident: CR37 article-title: A hybrid EA for reactive flexible job-shop scheduling publication-title: Procedia Comput Sci doi: 10.1016/j.procs.2012.09.039 – volume: 49 start-page: 2409 issue: 8 year: 2011 end-page: 2423 ident: CR52 article-title: A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints publication-title: Int J Prod Res doi: 10.1080/00207541003709544 – volume: 26 start-page: 533 issue: 4 year: 2010 end-page: 541 ident: CR3 article-title: An artificial immune algorithm for the flexible job-shop scheduling problem publication-title: Future Gener Comput Syst doi: 10.1016/j.future.2009.10.004 – volume: 20 start-page: 2951 issue: 8 year: 2016 end-page: 2966 ident: CR16 article-title: Ant colony optimization with immigrants schemes for the dynamic railway junction rescheduling problem with multiple delays publication-title: Soft Comput doi: 10.1007/s00500-015-1924-x – volume: 73 start-page: 56 year: 2016 end-page: 66 ident: CR1 article-title: A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.03.009 – volume: 109 start-page: 1 year: 2016 end-page: 16 ident: CR22 article-title: Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2016.06.014 – volume: 38 start-page: 1111 issue: 3 year: 2014 end-page: 1132 ident: CR34 article-title: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities publication-title: Appl Math Model doi: 10.1016/j.apm.2013.07.038 – volume: 91 start-page: 106208 year: 2020 ident: CR38 article-title: Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106208 – volume: 28 start-page: 153 issue: 5 year: 1984 end-page: 162 ident: CR55 article-title: Scheduling on semi-identical processors publication-title: Z Oper Res doi: 10.1007/BF01920917 – volume: 43 start-page: 3103 issue: 15 year: 2005 end-page: 3129 ident: CR13 article-title: Anticipation and flexibility in dynamic scheduling publication-title: Int J Prod Res doi: 10.1080/00207540500077140 – volume: 13 start-page: 3259 issue: 7 year: 2013 end-page: 3272 ident: CR67 article-title: A hybrid harmony search algorithm for the flexible job shop scheduling problem publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2013.02.013 – volume: 23 start-page: 551 issue: 3 year: 2016 end-page: 591 ident: CR15 article-title: A research survey: review of flexible job shop scheduling techniques publication-title: Int Trans Oper Res doi: 10.1111/itor.12199 – volume: 58 start-page: 2561 issue: 9 year: 2020 end-page: 2580 ident: CR73 article-title: Automatic design of scheduling policies for dynamic flexible job shop scheduling via surrogate-assisted cooperative co-evolution genetic programming publication-title: Int J Prod Res doi: 10.1080/00207543.2019.1620362 – volume: 146 start-page: 68 year: 2016 end-page: 78 ident: CR64 article-title: Joint optimization of production scheduling and machine group preventive maintenance publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2015.10.013 – volume: 21 start-page: 103 issue: 3 year: 1977 end-page: 116 ident: CR12 article-title: Lexicographic quasiconcave multiobjective programming publication-title: Z Oper Res doi: 10.1007/BF01919766 – volume: 41 start-page: 157 issue: 3 year: 1993 end-page: 183 ident: CR300 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Ann Oper Res doi: 10.1007/BF02023073 – volume: 62 start-page: 670 issue: 2 year: 2012 end-page: 686 ident: CR68 article-title: Genetic algorithms for match-up rescheduling of the flexible manufacturing systems publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.12.001 – volume: 42 start-page: 7652 issue: 21 year: 2015 end-page: 7663 ident: CR21 article-title: A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2015.06.004 – volume: 132 start-page: 279 issue: 2 year: 2011 end-page: 291 ident: CR2 article-title: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2011.04.020 – volume: 68 start-page: 1317 issue: 5–8 year: 2013 end-page: 1326 ident: CR62 article-title: A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-013-4923-z – volume: 58 start-page: 1115 issue: 9 year: 2012 end-page: 1129 ident: CR48 article-title: A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-011-3437-9 – volume: 57 start-page: 3121 issue: 10 year: 2019 end-page: 3137 ident: CR45 article-title: Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming publication-title: Int J Prod Res doi: 10.1080/00207543.2018.1543964 – volume: 49 start-page: 585 issue: 2 year: 2011 end-page: 610 ident: CR6 article-title: A simulation based approach to analyse the effects of job release on the performance of a multi-stage job-shop with processing flexibility publication-title: Int J Prod Res doi: 10.1080/00207540903479778 – year: 2020 ident: CR39 article-title: Reactive scheduling approach for solving a realistic flexible job shop scheduling problem publication-title: Int J Prod Res doi: 10.1080/00207543.2020.1790686 – volume: 112 start-page: 595 year: 2017 end-page: 606 ident: CR43 article-title: Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.03.006 – volume: 6 start-page: 904 issue: 4 year: 2019 end-page: 916 ident: CR24 article-title: A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems publication-title: IEEE CAA J Auto Sin doi: 10.1109/JAS.2019.1911540 – volume: 40 start-page: 4523 issue: 17 year: 2002 ident: 6053_CR4 publication-title: Int J Prod Res doi: 10.1080/00207540210147043 – volume: 420 start-page: 159 year: 2017 ident: 6053_CR8 publication-title: Inf Sci doi: 10.1016/j.ins.2017.08.058 – volume: 106 start-page: 236 year: 2017 ident: 6053_CR17 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2016.10.019 – volume: 68 start-page: 1317 issue: 5–8 year: 2013 ident: 6053_CR62 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-013-4923-z – volume: 8 start-page: 487 issue: 4 year: 1960 ident: 6053_CR27 publication-title: Oper Res doi: 10.1287/opre.8.4.487 – volume: 6 start-page: 39 issue: 1 year: 2003 ident: 6053_CR61 publication-title: J Sch doi: 10.1023/A:1022235519958 – volume: 42 start-page: 7652 issue: 21 year: 2015 ident: 6053_CR21 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2015.06.004 – volume: 62 start-page: 670 issue: 2 year: 2012 ident: 6053_CR68 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.12.001 – volume: 25 start-page: 2863 issue: 4 year: 2021 ident: 6053_CR63 publication-title: Soft Comput doi: 10.1007/s00500-020-05347-z – volume: 49 start-page: 2409 issue: 8 year: 2011 ident: 6053_CR52 publication-title: Int J Prod Res doi: 10.1080/00207541003709544 – volume: 276 start-page: 204 year: 2014 ident: 6053_CR10 publication-title: Inf Sci doi: 10.1016/j.ins.2014.02.056 – volume: 146 start-page: 68 year: 2016 ident: 6053_CR64 publication-title: Reliab Eng Syst Saf doi: 10.1016/j.ress.2015.10.013 – volume: 12 start-page: 110 year: 2012 ident: 6053_CR37 publication-title: Procedia Comput Sci doi: 10.1016/j.procs.2012.09.039 – volume: 57 start-page: 3121 issue: 10 year: 2019 ident: 6053_CR45 publication-title: Int J Prod Res doi: 10.1080/00207543.2018.1543964 – volume: 52 start-page: 3858 issue: 13 year: 2014 ident: 6053_CR58 publication-title: Int J Prod Res doi: 10.1080/00207543.2013.784408 – volume: 58 start-page: 1115 issue: 9 year: 2012 ident: 6053_CR48 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-011-3437-9 – volume: 112 start-page: 595 year: 2017 ident: 6053_CR43 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.03.006 – volume: 35 start-page: 3202 issue: 10 year: 2008 ident: 6053_CR46 publication-title: Comput Oper Res doi: 10.1016/j.cor.2007.02.014 – volume: 41 start-page: 157 issue: 3 year: 1993 ident: 6053_CR300 publication-title: Ann Oper Res doi: 10.1007/BF02023073 – volume: 24 start-page: 763 issue: 4 year: 2013 ident: 6053_CR41 publication-title: J Intell Manuf doi: 10.1007/s10845-012-0626-9 – volume: 13 start-page: 3259 issue: 7 year: 2013 ident: 6053_CR67 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2013.02.013 – volume: 20 start-page: 481 issue: 4 year: 2009 ident: 6053_CR26 publication-title: J Intell Manuf doi: 10.1007/s10845-008-0150-0 – volume: 7 start-page: 721 issue: 5 year: 2016 ident: 6053_CR42 publication-title: J Ambient Intell Hum Comput doi: 10.1007/s12652-016-0370-7 – volume: 19 start-page: 2111 issue: 8 year: 2015 ident: 6053_CR30 publication-title: Soft Comput doi: 10.1007/s00500-014-1395-5 – volume: 65 start-page: 487 issue: 3 year: 2018 ident: 6053_CR70 publication-title: IEEE Trans Eng Manag doi: 10.1109/TEM.2017.2785774 – volume: 58 start-page: 2561 issue: 9 year: 2020 ident: 6053_CR73 publication-title: Int J Prod Res doi: 10.1080/00207543.2019.1620362 – volume: 113 start-page: 10 year: 2017 ident: 6053_CR35 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.09.005 – year: 2020 ident: 6053_CR39 publication-title: Int J Prod Res doi: 10.1080/00207543.2020.1790686 – volume: 43 start-page: 3103 issue: 15 year: 2005 ident: 6053_CR13 publication-title: Int J Prod Res doi: 10.1080/00207540500077140 – volume: 149 start-page: 106863 year: 2020 ident: 6053_CR14 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2020.106863 – volume: 20 start-page: 2951 issue: 8 year: 2016 ident: 6053_CR16 publication-title: Soft Comput doi: 10.1007/s00500-015-1924-x – volume: 12 start-page: 2896 issue: 9 year: 2012 ident: 6053_CR33 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2012.04.012 – volume: 9 start-page: 126 issue: 1 year: 2015 ident: 6053_CR60 publication-title: Eur J Ind Eng doi: 10.1504/EJIE.2015.067451 – volume: 132 start-page: 279 issue: 2 year: 2011 ident: 6053_CR2 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2011.04.020 – volume: 66 start-page: 501 issue: 1–4 year: 2013 ident: 6053_CR29 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-012-4344-4 – volume: 91 start-page: 106208 year: 2020 ident: 6053_CR38 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106208 – volume: 26 start-page: 533 issue: 4 year: 2010 ident: 6053_CR3 publication-title: Future Gener Comput Syst doi: 10.1016/j.future.2009.10.004 – volume: 54 start-page: 1091 issue: 9–12 year: 2011 ident: 6053_CR50 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-010-2986-7 – volume: 13 start-page: 995 issue: 10 year: 2009 ident: 6053_CR59 publication-title: Soft Comput doi: 10.1007/s00500-008-0367-z – volume: 298 start-page: 198 year: 2015 ident: 6053_CR56 publication-title: Inf Sci doi: 10.1016/j.ins.2014.11.036 – volume: 123 start-page: 105031 year: 2020 ident: 6053_CR25 publication-title: Comput Oper Res doi: 10.1016/j.cor.2020.105031 – volume: 109 start-page: 1 year: 2016 ident: 6053_CR22 publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2016.06.014 – volume: 62 start-page: 259 issue: 3 year: 1999 ident: 6053_CR53 publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(98)00248-5 – volume: 37 start-page: 49 issue: 1 year: 2005 ident: 6053_CR5 publication-title: Eng Opt doi: 10.1080/0305215042000268606 – volume: 2 start-page: 114 issue: 2 year: 2010 ident: 6053_CR18 publication-title: CIRP J Manuf Sci Technol doi: 10.1016/j.cirpj.2009.10.001 – volume: 49 start-page: 585 issue: 2 year: 2011 ident: 6053_CR6 publication-title: Int J Prod Res doi: 10.1080/00207540903479778 – volume: 21 start-page: 103 issue: 3 year: 1977 ident: 6053_CR12 publication-title: Z Oper Res doi: 10.1007/BF01919766 – volume: 19 start-page: 167 issue: 1 year: 1988 ident: 6053_CR47 publication-title: Dec Sci doi: 10.1111/j.1540-5915.1988.tb00260.x – volume: 27 start-page: 363 issue: 2 year: 2016 ident: 6053_CR23 publication-title: J Intell Manuf doi: 10.1007/s10845-014-0869-8 – volume: 32 start-page: 563 issue: 5–6 year: 2007 ident: 6053_CR54 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-005-0375-4 – volume: 95 start-page: 106544 year: 2020 ident: 6053_CR36 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106544 – volume: 37 start-page: 678 issue: 1 year: 2010 ident: 6053_CR66 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2009.06.007 – volume: 6 start-page: 904 issue: 4 year: 2019 ident: 6053_CR24 publication-title: IEEE CAA J Auto Sin doi: 10.1109/JAS.2019.1911540 – volume: 58 start-page: 449 year: 2017 ident: 6053_CR69 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2017.04.060 – volume: 73 start-page: 56 year: 2016 ident: 6053_CR1 publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.03.009 – volume: 55 start-page: 3308 issue: 11 year: 2017 ident: 6053_CR7 publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1306134 – volume: 10 start-page: 888 issue: 3 year: 2010 ident: 6053_CR65 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2009.10.006 – volume: 6 start-page: 109 issue: 2 year: 1995 ident: 6053_CR19 publication-title: J Glob Optim doi: 10.1007/BF01096763 – volume: 17 start-page: 493 issue: 4 year: 2006 ident: 6053_CR20 publication-title: J Intell Manuf doi: 10.1007/s10845-005-0021-x – volume: 38 start-page: 1111 issue: 3 year: 2014 ident: 6053_CR34 publication-title: Appl Math Model doi: 10.1016/j.apm.2013.07.038 – volume-title: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques year: 1984 ident: 6053_CR32 – volume: 21 start-page: 7021 issue: 23 year: 2017 ident: 6053_CR31 publication-title: Soft Comput doi: 10.1007/s00500-016-2241-8 – volume: 56 start-page: 2506 issue: 7 year: 2018 ident: 6053_CR28 publication-title: Int J Prod Res doi: 10.1080/00207543.2017.1388933 – volume: 9 start-page: 101 issue: 2 year: 2005 ident: 6053_CR40 publication-title: Soft Comput doi: 10.1007/s00500-003-0352-5 – volume: 48 start-page: 6821 issue: 22 year: 2010 ident: 6053_CR51 publication-title: Int J Prod Res doi: 10.1080/00207540903308969 – volume: 23 start-page: 551 issue: 3 year: 2016 ident: 6053_CR15 publication-title: Int Trans Oper Res doi: 10.1111/itor.12199 – volume: 28 start-page: 153 issue: 5 year: 1984 ident: 6053_CR55 publication-title: Z Oper Res doi: 10.1007/BF01920917 – volume: 269 start-page: 583 issue: 1 year: 2018 ident: 6053_CR49 publication-title: Ann Oper Res doi: 10.1007/s10479-017-2594-0 – volume: 55 start-page: 3173 issue: 11 year: 2017 ident: 6053_CR71 publication-title: Int J Prod Res doi: 10.1080/00207543.2016.1267414 – volume: 46 start-page: 152 year: 2018 ident: 6053_CR9 publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2017.12.005 – volume: 56 start-page: 425 year: 2020 ident: 6053_CR11 publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2020.06.005 – volume: 53 start-page: 100632 year: 2020 ident: 6053_CR57 publication-title: Swarm Evol Comput doi: 10.1016/j.swevo.2019.100632 – volume: 29 start-page: 603 issue: 3 year: 2018 ident: 6053_CR44 publication-title: J Intell Manuf doi: 10.1007/s10845-015-1039-3 – volume: 87 start-page: 1387 issue: 5 year: 2016 ident: 6053_CR72 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-013-4867-3
SSID	ssj0021753
Score	2.409457
Snippet	In the present study, we proposed a greedy randomized adaptive search procedure (GRASP) for integrated scheduling of dynamic flexible job shops with a novel...
SourceID	crossref springer
SourceType	Enrichment Source Index Database Publisher
StartPage	14893
SubjectTerms	Application of Soft Computing Artificial Intelligence Computational Intelligence Control Engineering Mathematical Logic and Foundations Mechatronics Robotics
Title	Greedy randomized adaptive search procedure for simultaneous scheduling of production and preventive maintenance activities in dynamic flexible job shops
URI	https://link.springer.com/article/10.1007/s00500-021-06053-0
Volume	25
WOSCitedRecordID	wos000680819800008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1433-7479 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1433-7479 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: K7- dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-7479 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1433-7479 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: RSV dateStart: 19970401 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NS8NAEF2ketCDH1Xxmzl400DSTTfJUUXxIKVULd7CZmeDkTYpTSvoP_HfOrtJioIICrmEzC6Bmdl5y857y9gp1XzpKc4d5EI4PiEOyjk_dLiMUHV8TIRlyA3vgl4vfHqK-jUprGy63ZsjSbtSL8huRqrEdUxLgUsYnDu0UV-mcheadBzcDxfbrFp7koAAYUcquDVV5uc5vpej72ehtsTcbPzv5zbZeg0p4aKKgS22pPM222iua4A6e9ts7Yv24Db7MB03-AZUq7AYZ-8aQaKcmNUPqvAHW9xwPtVAyBbKzDQfylwX8xJoT0xfDJUditQYYqVCCzQbvVayUDTTWBo9CiPqocFQKF6tgCtkOeBbLseZgtQociYjDS9FAuVzMSl32OPN9cPVrVPf0-CoTuTNHNFRXBEUkUomhBdUgAQCky6qrk4jKYI0olVEaF8hJ3AZEQDCNA2FclFEIpCc77JWXuR6j4FnqEc-BlG3K31XpaFPj_ZcVNxIXeE-8xp3xaoWMTd3aYzihfyy9URMnoitJ2J3n50txkwqCY9frc8bD8d1Ope_mB_8zfyQrXZMkNh-mCPWmk3n-pitqNdZVk5P2PLlda8_OLHx_AnZu_Al
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NS8NAEF1EBfVg_cRv5-BNA0k33TRHEUWxFvELb2Gzs8FIm5SmFeo_8d86u0mKgggKuYRMlsDM7ntL5r1l7IgwX3qKcwe5EI5PjIPmnN92uAxRNX2MhVXIPXWCbrf9_BzeVqKwou52r39J2pV6KnYzViWuY1oKXOLg3KGN-pxPiGUa-e7un6bbrMp7kogAcUcC3Eoq8_MY3-Ho-79QCzEXjf993ApbriglnJY1sMpmdLbGGvVxDVDN3jW29MV7cJ19mI4bnABhFeb99F0jSJQDs_pBWf5gwQ3HQw3EbKFITfOhzHQ-LoD2xPTESNkhT0wgli60QKPRbWkLRSP1pfGjMKYeGoyE4s0auEKaAU4y2U8VJMaRM-5peM1jKF7yQbHBHi_OH84uneqcBkc1Q2_kiKbiiqiIVDImvqACJBIYt1C1dBJKESQhrSJC-wo5kcuQCBAmSVsoF0UoAsn5JpvN8kxvMfCM9MjHIGy1pO-qpO3TpT0XFTdWV7jNvDpdkapMzM1ZGr1oar9sMxFRJiKbicjdZsfTdwalhcev0Sd1hqNqOhe_hO_8LfyQLVw-3HSizlX3epctNk3B2N6YPTY7Go71PptXb6O0GB7Ymv4ElXjxbw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NS-RAEG1ERfTg97LqqnXwpsFkOtOZHBd3B0UZBD_wFjpdHYzMJMNkRtB_4r_dqk5mUFgEEXIJqTSB6up6Req9EuKIcr4OjJQeSqW8kBAHxVzY8aSO0bRCTJVjyN1fRb1e5-Ehvn7H4nfd7tNfkjWngVWaivHpELPTGfGNZUt8j9sLfMLj0qOifSHkoUFcr9_cz0quRoeSQAHhSEq-DW3m_2t8TE0f_4u6dNNd-_6HrovVBmrC73pvbIg5W2yKtekYB2iielOsvNMk3BJv3ImDL0A5DMtB_moRNOohn4pQhwW4pIeTkQVCvFDl3JSoC1tOKqBamZ4wxR3KjA2xVqcFWo1ua7koWmmgWaeCxT4sMLXi2Qm7Ql4AvhR6kBvIWKkz7Vt4KlOoHsthtS3uun9vz869Zn6DZ1pxMPZUy0hDEEUbnRKOMBESOEzbaNo2i7WKsphOF2VDg5JAZ0zACLOso4yPKlaRlvKHmC_Kwv4UEDAlKcQobrd16JusE9JlAx-NZAks3BHB1HWJacTNecZGP5nJMjtPJOSJxHki8XfE8eydYS3t8an1ydTbSRPm1Sfmu18zPxRL13-6ydVF73JPLLd4v7iWmV9ifjya2H2xaJ7HeTU6cNv7H4Ns-lM
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Greedy+randomized+adaptive+search+procedure+for+simultaneous+scheduling+of+production+and+preventive+maintenance+activities+in+dynamic+flexible+job+shops&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Baykaso%C4%9Flu%2C+Adil&rft.au=Madeno%C4%9Flu%2C+Fatma+S.&rft.date=2021-12-01&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=25&rft.issue=23&rft.spage=14893&rft.epage=14932&rft_id=info:doi/10.1007%2Fs00500-021-06053-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00500_021_06053_0
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon