Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility
•A mathematical model is developed for the flexible job-shop scheduling problem (FSJP) with sequencing flexibility.•A novel hybrid bacterial foraging optimization algorithm (HBFOA) is presented to solve the FJSP with sequencing flexibility.•The HBFOA incorporates simulated annealing algorithm and a...
Uloženo v:
| Vydáno v: | Journal of manufacturing systems Ročník 54; s. 74 - 93 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.01.2020
|
| Témata: | |
| ISSN: | 0278-6125, 1878-6642 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •A mathematical model is developed for the flexible job-shop scheduling problem (FSJP) with sequencing flexibility.•A novel hybrid bacterial foraging optimization algorithm (HBFOA) is presented to solve the FJSP with sequencing flexibility.•The HBFOA incorporates simulated annealing algorithm and a local search procedure based on the critical path.•A decision support system (DSS) has been implemented to validate the efficiency of the HBFOA.•Numerical experiments are performed with a case study of small and mid-range enterprise and well-known literature instances.
The flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem (JSP) in which operations can be performed by a set of candidate capable machines. An extended version of the FJSP, entitled sequencing flexibility, is studied in this work, which considers precedence between the operations in the form of a directed acyclic graph instead of a sequential order. In this work, a mixed integer linear programming (MILP) formulation is presented to minimize weighted tardiness for the FJSP with sequencing flexibility. Due to the NP-hardness of the problem, a novel biomimicry hybrid bacterial foraging optimization algorithm (HBFOA) is developed, which is inspired by the behavior of E. coli bacteria in its search for food. The developed HBFOA search method is hybridized with simulated annealing (SA). Additionally, the algorithm has been enhanced by a local search method based on the manipulation of critical operations. Classical dispatching rules have been employed to create the initial swarm of HBFOA, and a new dispatching rule named minimum number of operations has been devised. The developed approach has been packaged in the form of a decision support system (DSS) developed on top of Microsoft Excel—a tool most small and mid-range enterprises (SME) use heavily for planning. A case study with local industry is presented to validate the proposed HBFOA and MILP. Additional numerical experiments using literature benchmarks are further used for validation. The results demonstrate that the HBFOA outperformed the classical dispatching rules and the best integer solution of MILP when minimizing the weighted tardiness and offered comparable results for the makespan instances. |
|---|---|
| AbstractList | •A mathematical model is developed for the flexible job-shop scheduling problem (FSJP) with sequencing flexibility.•A novel hybrid bacterial foraging optimization algorithm (HBFOA) is presented to solve the FJSP with sequencing flexibility.•The HBFOA incorporates simulated annealing algorithm and a local search procedure based on the critical path.•A decision support system (DSS) has been implemented to validate the efficiency of the HBFOA.•Numerical experiments are performed with a case study of small and mid-range enterprise and well-known literature instances.
The flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem (JSP) in which operations can be performed by a set of candidate capable machines. An extended version of the FJSP, entitled sequencing flexibility, is studied in this work, which considers precedence between the operations in the form of a directed acyclic graph instead of a sequential order. In this work, a mixed integer linear programming (MILP) formulation is presented to minimize weighted tardiness for the FJSP with sequencing flexibility. Due to the NP-hardness of the problem, a novel biomimicry hybrid bacterial foraging optimization algorithm (HBFOA) is developed, which is inspired by the behavior of E. coli bacteria in its search for food. The developed HBFOA search method is hybridized with simulated annealing (SA). Additionally, the algorithm has been enhanced by a local search method based on the manipulation of critical operations. Classical dispatching rules have been employed to create the initial swarm of HBFOA, and a new dispatching rule named minimum number of operations has been devised. The developed approach has been packaged in the form of a decision support system (DSS) developed on top of Microsoft Excel—a tool most small and mid-range enterprises (SME) use heavily for planning. A case study with local industry is presented to validate the proposed HBFOA and MILP. Additional numerical experiments using literature benchmarks are further used for validation. The results demonstrate that the HBFOA outperformed the classical dispatching rules and the best integer solution of MILP when minimizing the weighted tardiness and offered comparable results for the makespan instances. |
| Author | Baki, Mohammed Fazle Vital-Soto, Alejandro Azab, Ahmed |
| Author_xml | – sequence: 1 givenname: Alejandro surname: Vital-Soto fullname: Vital-Soto, Alejandro email: vitalsoa@uwindsor.ca organization: Production & Operations Management Research Laboratory, Faculty of Engineering, University of Windsor, Windsor, Ontario N9B 3P4, Canada – sequence: 2 givenname: Ahmed orcidid: 0000-0002-1520-9566 surname: Azab fullname: Azab, Ahmed email: azab@uwindsor.ca organization: Production & Operations Management Research Laboratory, Faculty of Engineering, University of Windsor, Windsor, Ontario N9B 3P4, Canada – sequence: 3 givenname: Mohammed Fazle surname: Baki fullname: Baki, Mohammed Fazle email: fbaki@uwindsor.ca organization: Odette School of Business, University of Windsor, Windsor, Ontario N9B 3P4, Canada |
| BookMark | eNp9kE1u2zAQRokgAeL8XCArXkAqScm0DWRTGG1TwEU37ZoYUiNrBEl0Saatc5PcNpTdVRdZccD53gfMu2GXk5-QsQcpSimk_tCX_RiPpRJyU0pZCiku2EKuV-tC61pdsoVQ8yzV8prdxNgLIVUt1IK9foPU4QiJHAx89A0ONO05TA0H3h1toIZesOEWXMJAOdP6APs54w-JRnrJqJ84DHsfKHXjvOe5krcD_iU7IO-9LWLnDzy6DpvnU_8h-Lwa-Z-M8Ii_nnFy8_8ZooHS8Y5dtTBEvP_33rKfnz_92D4Vu-9fvm4_7gpXCZEKtE7V1bLagNBW1ygBrBPQulZBvbKVljkGclOjaqulW2q91hYRNitcVcK56papc68LPsaArTkEGiEcjRRmlmt6M8s1s1wjpclyM7T-D3KUTiZSABreRx_PKOajfhMGEx3l87GhgC6ZxtN7-BsV6p2W |
| CitedBy_id | crossref_primary_10_1155_2022_9191247 crossref_primary_10_1155_2020_8810215 crossref_primary_10_1016_j_eswa_2022_119375 crossref_primary_10_1016_j_procir_2025_02_198 crossref_primary_10_1016_j_jmsy_2020_06_005 crossref_primary_10_3934_jimo_2025097 crossref_primary_10_1109_ACCESS_2025_3577044 crossref_primary_10_1111_exsy_13431 crossref_primary_10_1111_itor_13108 crossref_primary_10_1016_j_cor_2021_105263 crossref_primary_10_3390_app14104029 crossref_primary_10_1016_j_cor_2024_106952 crossref_primary_10_1016_j_swevo_2023_101416 crossref_primary_10_1080_19397038_2025_2507916 crossref_primary_10_1016_j_jmsy_2021_09_012 crossref_primary_10_3390_pr11010267 crossref_primary_10_1049_cim2_12117 crossref_primary_10_1016_j_knosys_2021_107815 crossref_primary_10_1007_s11042_023_14420_2 crossref_primary_10_1080_21681015_2025_2539209 crossref_primary_10_1007_s10845_020_01707_6 crossref_primary_10_1016_j_apm_2023_08_042 crossref_primary_10_1007_s11036_024_02302_2 crossref_primary_10_1080_23302674_2023_2221072 crossref_primary_10_1007_s10696_022_09446_x crossref_primary_10_3390_a13060142 crossref_primary_10_1016_j_jmsy_2023_07_004 crossref_primary_10_1111_exsy_13669 crossref_primary_10_3390_math13162605 crossref_primary_10_1016_j_jmsy_2021_08_003 crossref_primary_10_1007_s10845_020_01697_5 crossref_primary_10_1109_TASE_2024_3485810 crossref_primary_10_1016_j_tre_2021_102273 crossref_primary_10_3390_app11114741 crossref_primary_10_1016_j_cor_2022_105731 crossref_primary_10_1016_j_eswa_2023_122734 crossref_primary_10_1016_j_ejor_2020_12_021 crossref_primary_10_1016_j_swevo_2023_101421 crossref_primary_10_1016_j_jmsy_2022_01_006 crossref_primary_10_1016_j_simpat_2021_102416 crossref_primary_10_1080_00207543_2021_1967500 |
| Cites_doi | 10.1287/opre.40.1.113 10.1111/itor.12199 10.1126/science.220.4598.671 10.1109/MCS.2002.1004010 10.1016/S0278-6125(00)87643-8 10.1016/j.jmsy.2011.05.005 10.1016/j.ejor.2007.06.039 10.1016/j.eswa.2015.06.004 10.4018/ijaec.2014070104 10.1016/j.ijpe.2016.01.016 10.1007/s00521-013-1477-9 10.1016/S0278-6125(00)86631-5 10.1007/s11590-013-0669-7 10.1007/BF01719451 10.1016/0278-6125(93)90322-K 10.1007/BF02023073 10.1016/j.jmsy.2013.02.001 10.1016/j.ejor.2005.03.073 10.1016/j.ejor.2015.02.052 10.1016/j.jmsy.2019.05.004 10.1016/S0360-8352(02)00079-7 10.1016/j.cor.2016.03.009 10.1108/02635579410059455 10.1016/j.eswa.2017.04.019 10.1016/j.knosys.2019.02.016 10.1109/ACCESS.2018.2794198 10.1016/j.cor.2013.06.010 10.1016/j.asoc.2017.10.034 10.1016/j.cor.2007.02.014 10.1109/4235.585893 10.1080/00207543.2013.827806 10.1016/j.eswa.2018.01.011 10.1016/j.jmsy.2011.02.004 10.1016/j.rcim.2006.06.004 10.1016/j.apm.2008.10.029 10.1016/j.eswa.2009.06.007 10.18576/amis/100220 10.1016/j.apm.2009.09.002 10.1007/s10845-007-0026-8 10.1109/TSMCC.2002.1009117 10.1016/j.asoc.2009.10.006 10.1016/0278-6125(92)90063-L 10.1016/j.jmsy.2017.02.004 10.1287/moor.1.2.117 10.1007/BF02238804 10.1016/j.ejor.2004.04.020 10.1080/00207543.2014.889328 10.1016/j.ejor.2006.04.007 10.1016/S0378-4754(02)00019-8 10.1016/j.eswa.2015.09.050 10.1016/j.cie.2005.01.018 10.1016/j.eswa.2016.01.054 10.1007/s001700200144 10.1016/j.ejor.2017.08.021 10.1016/j.ejor.2009.01.008 10.1016/j.ejor.2015.06.023 10.1016/j.ijpe.2012.10.011 10.1080/00207540903055743 10.1016/0377-2217(94)90353-0 10.1007/s00170-011-3610-1 10.1016/j.jmsy.2013.04.015 |
| ContentType | Journal Article |
| Copyright | 2019 The Society of Manufacturing Engineers |
| Copyright_xml | – notice: 2019 The Society of Manufacturing Engineers |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jmsy.2019.11.010 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1878-6642 |
| EndPage | 93 |
| ExternalDocumentID | 10_1016_j_jmsy_2019_11_010 S0278612519300998 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29K 3EH 3V. 4.4 457 4G. 5GY 5VS 7-5 71M 7WY 883 88I 8AO 8FE 8FG 8FL 8FW 8G5 8P~ 8R4 8R5 9JN 9M8 AACTN AAEDT AAEDW AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AAXUO ABFNM ABJCF ABJNI ABMAC ABUWG ABXDB ABYKQ ACDAQ ACGFO ACGFS ACGOD ACIWK ACNNM ACRLP ADBBV ADEZE ADMUD ADTZH AEBSH AECPX AEKER AENEX AFFNX AFKRA AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARAPS ASPBG AVWKF AXJTR AZFZN AZQEC BENPR BEZIV BGLVJ BJAXD BKOJK BKOMP BLXMC BPHCQ C1A CCPQU CS3 D-I DU5 DWQXO E3Z EBS EFJIC EFLBG EJD EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FRNLG FYGXN G-2 GBLVA GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HVGLF HZ~ H~9 IHE J1W JJJVA K60 K6V K6~ K7- KOM L6V LY7 M0C M0F M0N M2O M2P M41 M7S MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P P62 PC. PQBIZ PQQKQ PRG PROAC PTHSS Q2X Q38 R2- RIG ROL RPZ RWL S0X SDF SES SET SPC SPCBC SST SSZ T5K TAE TN5 U5U WH7 WUQ ZHY ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFFHD AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS PHGZM PHGZT PQBZA PQGLB ~HD |
| ID | FETCH-LOGICAL-c300t-ebc243539a06b64e1aabc0afcf2a47b361300a194e2f35c56686beea97e730cc3 |
| ISICitedReferencesCount | 57 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000521511500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0278-6125 |
| IngestDate | Tue Nov 18 21:14:28 EST 2025 Sat Nov 29 07:23:41 EST 2025 Fri Feb 23 02:46:47 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Flexible job-shop scheduling problem Weighted tardiness Decision support system Bacterial foraging optimization algorithm Sequencing-flexibility Simulated annealing |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-ebc243539a06b64e1aabc0afcf2a47b361300a194e2f35c56686beea97e730cc3 |
| ORCID | 0000-0002-1520-9566 |
| PageCount | 20 |
| ParticipantIDs | crossref_primary_10_1016_j_jmsy_2019_11_010 crossref_citationtrail_10_1016_j_jmsy_2019_11_010 elsevier_sciencedirect_doi_10_1016_j_jmsy_2019_11_010 |
| PublicationCentury | 2000 |
| PublicationDate | January 2020 2020-01-00 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – month: 01 year: 2020 text: January 2020 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of manufacturing systems |
| PublicationYear | 2020 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Birgin, Ferreira, Ronconi (bib0070) 2015; 247 Garey, Johnson, Sethi (bib0120) 1976; 1 Shen, Dauzère-Pérès, Neufeld (bib0115) 2018; 265 Van Laarhoven, Aarts, Lenstra (bib0325) 1992; 40 Brandimarte (bib0065) 1993; 41 Šeda (bib0010) 2007; 1 Kechadi, Low, Goncalves (bib0020) 2013; 32 Chaudhry, Khan (bib0235) 2016; 23 Zhao, Jiang, Zhang, Wang (bib0285) 2015; 28 Jamili (bib0015) 2016; 55 Słowiński, Soniewicki, Wȩglarz (bib0315) 1994; 79 Wu, Zhang, Jiang, Yang, Liang (bib0340) 2007 Ahmadi, Zandieh, Farrokh, Emami (bib0135) 2016; 73 Rossi, Dini (bib0155) 2007; 23 Montgomery (bib0360) 2008 Liu, Wang, Leung (bib0250) 2018; 62 Jin, Luh, Thakur (bib0045) 1999; 18 Bagheri, Zandieh (bib0210) 2011; 30 Wolpert, Macready (bib0230) 1997; 1 Prakash, Vidyarthi (bib0265) 2014; 5 Majumder, Laha, Suganthan (bib0270) 2019; 172 Güçdemir, Selim (bib0035) 2017; 43 Narendhar, Amudha (bib0275) 2012 Larry, Joachim (bib0310) 1994; 94 González, Vela, Varela (bib0220) 2015; 245 Li, Wu, Yang, Zhou, Du (bib0030) 2012; 31 Huang, Yang, Cheng (bib0165) 2013; 141 Wang, Zhou, Xu, Wang, Liu (bib0170) 2012; 60 Sun, Noble (bib0005) 1999; 18 Atasagun, Kara (bib0260) 2014; 25 Kacem, Hammadi, Borne (bib0060) 2002; 60 Amiri, Zandieh, Yazdani, Bagheri (bib0200) 2010; 48 Xing, Chen, Wang, Zhao, Xiong (bib0160) 2010; 10 Pezzella, Morganti, Ciaschetti (bib0125) 2008; 35 Shahsavari-Pour, Ghasemishabankareh (bib0330) 2013; 32 Demir, İşleyen (bib0140) 2014; 52 Fattahi, Jolai, Arkat (bib0295) 2009; 33 Zheng, Wang (bib0175) 2016 Yuan, Xu (bib0365) 2013; 40 Kacem, Hammadi, Borne (bib0145) 2002; 32 Gao, Peng, Zhou, Li (bib0180) 2006 Shivakumar, Amudha (bib0280) 2012; 12 Passino (bib0225) 2002; 22 Turanoğlu, Akkaya (bib0240) 2018; 98 Loukil, Teghem, Fortemps (bib0290) 2007; 179 Lin, Chang, Yeng, Huang (bib0040) 2019; 52 Gan, Lee (bib0090) 2002; 20 Hurink, Jurisch, Thole (bib0190) 1994; 15 Xia, Wu (bib0335) 2005; 48 Brucker, Schlie (bib0055) 1990; 45 Li, Gao (bib0215) 2016; 174 Vancheeswaran, Townsend (bib0050) 1993; 12 Roshanaei, Azab, ElMaraghy (bib0110) 2013; 51 Kaplanoğlu (bib0305) 2016; 45 Hernández-Ocana, Pozos-Parra, Mezura-Montes (bib0345) 2016; 10 Gen, Gao, Lin (bib0350) 2009 Özgüven, Özbakır, Yavuz (bib0105) 2010; 34 De Giovanni, Pezzella (bib0130) 2010; 200 Cormen, Leiserson, Rivest, Stein (bib0355) 2009 Chen, Li, Wang, Zheng, Xu, Fan (bib0255) 2017; 83 Hernández-Ocaña, Chávez-Bosquez, Hernández-Torruco, Canul-Reich, Pozos-Parra (bib0245) 2018; 6 Alvarez-Valdés, Fuertes, Tamarit, Giménez, Ramos (bib0085) 2005; 165 Fattahi, Mehrabad, Jolai (bib0100) 2007; 18 Kirkpatrick, Gelatt, Vecchi (bib0320) 1983; 220 Birgin, Feofiloff, Fernandes, De Melo, Oshiro, Ronconi (bib0075) 2014; 8 Ho, Tay, Lai (bib0150) 2007; 179 Yazdani, Amiri, Zandieh (bib0205) 2010; 37 Mastrolilli, Gambardella (bib0195) 2000 Pinedo (bib0300) 2016 Karsiti, Cruz, Mulligan (bib0025) 1992; 11 Vilcot, Billaut (bib0080) 2008; 190 Gao, Suganthan, Chua, Chong, Cai, Pan (bib0185) 2015; 42 Lee, Jeong, Moon (bib0095) 2002; 43 Li (10.1016/j.jmsy.2019.11.010_bib0030) 2012; 31 Xia (10.1016/j.jmsy.2019.11.010_bib0335) 2005; 48 Gen (10.1016/j.jmsy.2019.11.010_bib0350) 2009 Kacem (10.1016/j.jmsy.2019.11.010_bib0060) 2002; 60 Zhao (10.1016/j.jmsy.2019.11.010_bib0285) 2015; 28 Pezzella (10.1016/j.jmsy.2019.11.010_bib0125) 2008; 35 Brandimarte (10.1016/j.jmsy.2019.11.010_bib0065) 1993; 41 Šeda (10.1016/j.jmsy.2019.11.010_bib0010) 2007; 1 Demir (10.1016/j.jmsy.2019.11.010_bib0140) 2014; 52 Ho (10.1016/j.jmsy.2019.11.010_bib0150) 2007; 179 Majumder (10.1016/j.jmsy.2019.11.010_bib0270) 2019; 172 Van Laarhoven (10.1016/j.jmsy.2019.11.010_bib0325) 1992; 40 Huang (10.1016/j.jmsy.2019.11.010_bib0165) 2013; 141 Roshanaei (10.1016/j.jmsy.2019.11.010_bib0110) 2013; 51 Li (10.1016/j.jmsy.2019.11.010_bib0215) 2016; 174 Kacem (10.1016/j.jmsy.2019.11.010_bib0145) 2002; 32 Jin (10.1016/j.jmsy.2019.11.010_bib0045) 1999; 18 Shivakumar (10.1016/j.jmsy.2019.11.010_bib0280) 2012; 12 Wolpert (10.1016/j.jmsy.2019.11.010_bib0230) 1997; 1 Larry (10.1016/j.jmsy.2019.11.010_bib0310) 1994; 94 Pinedo (10.1016/j.jmsy.2019.11.010_bib0300) 2016 Lee (10.1016/j.jmsy.2019.11.010_bib0095) 2002; 43 Xing (10.1016/j.jmsy.2019.11.010_bib0160) 2010; 10 Kaplanoğlu (10.1016/j.jmsy.2019.11.010_bib0305) 2016; 45 Słowiński (10.1016/j.jmsy.2019.11.010_bib0315) 1994; 79 Hernández-Ocana (10.1016/j.jmsy.2019.11.010_bib0345) 2016; 10 Chen (10.1016/j.jmsy.2019.11.010_bib0255) 2017; 83 Kechadi (10.1016/j.jmsy.2019.11.010_bib0020) 2013; 32 Gao (10.1016/j.jmsy.2019.11.010_bib0180) 2006 Lin (10.1016/j.jmsy.2019.11.010_bib0040) 2019; 52 Yuan (10.1016/j.jmsy.2019.11.010_bib0365) 2013; 40 Shen (10.1016/j.jmsy.2019.11.010_bib0115) 2018; 265 Sun (10.1016/j.jmsy.2019.11.010_bib0005) 1999; 18 Bagheri (10.1016/j.jmsy.2019.11.010_bib0210) 2011; 30 Hernández-Ocaña (10.1016/j.jmsy.2019.11.010_bib0245) 2018; 6 Jamili (10.1016/j.jmsy.2019.11.010_bib0015) 2016; 55 Birgin (10.1016/j.jmsy.2019.11.010_bib0075) 2014; 8 Passino (10.1016/j.jmsy.2019.11.010_bib0225) 2002; 22 Brucker (10.1016/j.jmsy.2019.11.010_bib0055) 1990; 45 Fattahi (10.1016/j.jmsy.2019.11.010_bib0100) 2007; 18 Karsiti (10.1016/j.jmsy.2019.11.010_bib0025) 1992; 11 Vilcot (10.1016/j.jmsy.2019.11.010_bib0080) 2008; 190 Kirkpatrick (10.1016/j.jmsy.2019.11.010_bib0320) 1983; 220 De Giovanni (10.1016/j.jmsy.2019.11.010_bib0130) 2010; 200 Özgüven (10.1016/j.jmsy.2019.11.010_bib0105) 2010; 34 Rossi (10.1016/j.jmsy.2019.11.010_bib0155) 2007; 23 Vancheeswaran (10.1016/j.jmsy.2019.11.010_bib0050) 1993; 12 Gan (10.1016/j.jmsy.2019.11.010_bib0090) 2002; 20 Chaudhry (10.1016/j.jmsy.2019.11.010_bib0235) 2016; 23 González (10.1016/j.jmsy.2019.11.010_bib0220) 2015; 245 Fattahi (10.1016/j.jmsy.2019.11.010_bib0295) 2009; 33 Garey (10.1016/j.jmsy.2019.11.010_bib0120) 1976; 1 Ahmadi (10.1016/j.jmsy.2019.11.010_bib0135) 2016; 73 Hurink (10.1016/j.jmsy.2019.11.010_bib0190) 1994; 15 Amiri (10.1016/j.jmsy.2019.11.010_bib0200) 2010; 48 Mastrolilli (10.1016/j.jmsy.2019.11.010_bib0195) 2000 Turanoğlu (10.1016/j.jmsy.2019.11.010_bib0240) 2018; 98 Wang (10.1016/j.jmsy.2019.11.010_bib0170) 2012; 60 Loukil (10.1016/j.jmsy.2019.11.010_bib0290) 2007; 179 Narendhar (10.1016/j.jmsy.2019.11.010_bib0275) 2012 Birgin (10.1016/j.jmsy.2019.11.010_bib0070) 2015; 247 Gao (10.1016/j.jmsy.2019.11.010_bib0185) 2015; 42 Montgomery (10.1016/j.jmsy.2019.11.010_bib0360) 2008 Shahsavari-Pour (10.1016/j.jmsy.2019.11.010_bib0330) 2013; 32 Yazdani (10.1016/j.jmsy.2019.11.010_bib0205) 2010; 37 Cormen (10.1016/j.jmsy.2019.11.010_bib0355) 2009 Prakash (10.1016/j.jmsy.2019.11.010_bib0265) 2014; 5 Atasagun (10.1016/j.jmsy.2019.11.010_bib0260) 2014; 25 Wu (10.1016/j.jmsy.2019.11.010_bib0340) 2007 Liu (10.1016/j.jmsy.2019.11.010_bib0250) 2018; 62 Güçdemir (10.1016/j.jmsy.2019.11.010_bib0035) 2017; 43 Alvarez-Valdés (10.1016/j.jmsy.2019.11.010_bib0085) 2005; 165 Zheng (10.1016/j.jmsy.2019.11.010_bib0175) 2016 |
| References_xml | – volume: 20 start-page: 214 year: 2002 end-page: 222 ident: bib0090 article-title: Scheduling of flexible-sequenced process plans in a mould manufacturing shop publication-title: Int J Adv Manuf Technol – volume: 141 start-page: 685 year: 2013 end-page: 697 ident: bib0165 article-title: Flexible job shop scheduling with due window—a two-pheromone ant colony approach publication-title: Int J Prod Econ – volume: 18 start-page: 284 year: 1999 end-page: 300 ident: bib0045 article-title: An effective optimization-based algorithm for job shop scheduling with fixed-size transfer lots publication-title: J Manuf Syst – volume: 32 start-page: 689 year: 2013 end-page: 699 ident: bib0020 article-title: Recurrent neural network approach for cyclic job shop scheduling problem publication-title: J Manuf Syst – volume: 10 start-page: 607 year: 2016 end-page: 622 ident: bib0345 article-title: Improved modified bacterial foraging optimization algorithm to solve constrained numerical optimization problems publication-title: Appl Math Inf Sci – volume: 41 start-page: 157 year: 1993 end-page: 183 ident: bib0065 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Ann Oper Res – volume: 220 start-page: 671 year: 1983 ident: bib0320 article-title: Optimization by simulated annealing publication-title: Science – volume: 34 start-page: 1539 year: 2010 end-page: 1548 ident: bib0105 article-title: Mathematical models for job-shop scheduling problems with routing and process plan flexibility publication-title: Appl Math Model – volume: 12 start-page: 7 year: 2012 end-page: 16 ident: bib0280 article-title: A hybrid bacterial swarming methodology for job shop scheduling environment publication-title: Glob J Comput Sci Technol – volume: 35 start-page: 3202 year: 2008 end-page: 3212 ident: bib0125 article-title: A genetic algorithm for the flexible job-shop scheduling problem publication-title: Comput Oper Res – volume: 18 start-page: 331 year: 2007 end-page: 342 ident: bib0100 article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems publication-title: J Intell Manuf – volume: 179 start-page: 709 year: 2007 end-page: 722 ident: bib0290 article-title: A multi-objective production scheduling case study solved by simulated annealing publication-title: Eur J Oper Res – volume: 40 start-page: 2864 year: 2013 end-page: 2877 ident: bib0365 article-title: An integrated search heuristic for large-scale flexible job shop scheduling problems publication-title: Comput Oper Res – volume: 48 start-page: 409 year: 2005 end-page: 425 ident: bib0335 article-title: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems publication-title: Comput Ind Eng – volume: 15 start-page: 205 year: 1994 end-page: 215 ident: bib0190 article-title: Tabu search for the job-shop scheduling problem with multi-purpose machines publication-title: Operations-Res-Spektrum – volume: 172 start-page: 104 year: 2019 end-page: 122 ident: bib0270 article-title: Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times publication-title: Knowl Based Syst – volume: 200 start-page: 395 year: 2010 end-page: 408 ident: bib0130 article-title: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem publication-title: Eur J Oper Res – volume: 60 start-page: 303 year: 2012 end-page: 315 ident: bib0170 article-title: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem publication-title: Int J Adv Manuf Technol – start-page: 3018 year: 2006 end-page: 3027 ident: bib0180 article-title: Solving flexible job shop scheduling problem using general particle swarm optimization publication-title: Proceedings of the 36th CIE conference on computers & industrial engineering – volume: 55 start-page: 341 year: 2016 end-page: 350 ident: bib0015 article-title: Robust job shop scheduling problem: mathematical models, exact and heuristic algorithms publication-title: Expert Syst Appl – volume: 45 start-page: 71 year: 2016 end-page: 84 ident: bib0305 article-title: An object-oriented approach for multi-objective flexible job-shop scheduling problem publication-title: Expert Syst Appl – volume: 52 start-page: 3905 year: 2014 end-page: 3921 ident: bib0140 article-title: An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations publication-title: Int J Prod Res – volume: 83 start-page: 1 year: 2017 end-page: 17 ident: bib0255 article-title: A novel bacterial foraging optimization algorithm for feature selection publication-title: Expert Syst Appl – year: 2016 ident: bib0300 article-title: Scheduling: theory, algorithms, and systems – volume: 40 start-page: 113 year: 1992 end-page: 125 ident: bib0325 article-title: Job shop scheduling by simulated annealing publication-title: Oper Res – volume: 33 start-page: 3076 year: 2009 end-page: 3087 ident: bib0295 article-title: Flexible job shop scheduling with overlapping in operations publication-title: Appl Math Model – volume: 1 start-page: 117 year: 1976 end-page: 129 ident: bib0120 article-title: The complexity of flowshop and jobshop scheduling publication-title: Math Oper Res – volume: 12 start-page: 315 year: 1993 end-page: 325 ident: bib0050 article-title: Two-stage heuristic procedure for scheduling job shops publication-title: J Manuf Syst – volume: 60 start-page: 245 year: 2002 end-page: 276 ident: bib0060 article-title: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic publication-title: Math Comput Simul – volume: 23 start-page: 551 year: 2016 end-page: 591 ident: bib0235 article-title: A research survey: review of flexible job shop scheduling techniques publication-title: Int Trans Oper Res – volume: 48 start-page: 5671 year: 2010 end-page: 5689 ident: bib0200 article-title: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem publication-title: Int J Prod Res – volume: 179 start-page: 316 year: 2007 end-page: 333 ident: bib0150 article-title: An effective architecture for learning and evolving flexible job-shop schedules publication-title: Eur J Oper Res – volume: 62 start-page: 602 year: 2018 end-page: 618 ident: bib0250 article-title: Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning publication-title: Appl Soft Comput – volume: 265 start-page: 503 year: 2018 end-page: 516 ident: bib0115 article-title: Solving the flexible job shop scheduling problem with sequence-dependent setup times publication-title: Eur J Oper Res – volume: 98 start-page: 93 year: 2018 end-page: 104 ident: bib0240 article-title: A new hybrid heuristic algorithm based on bacterial foraging optimization for the dynamic facility layout problem publication-title: Expert Syst Appl – volume: 5 start-page: 57 year: 2014 end-page: 83 ident: bib0265 article-title: A hybrid GABFO scheduling for optimal makespan in computational grid publication-title: Int J Appl Evol Comput (IJAEC) – year: 2009 ident: bib0355 article-title: Introduction to algorithms – volume: 174 start-page: 93 year: 2016 end-page: 110 ident: bib0215 article-title: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem publication-title: Int J Prod Econ – volume: 25 start-page: 237 year: 2014 end-page: 250 ident: bib0260 article-title: Bacterial Foraging Optimization Algorithm for assembly line balancing publication-title: Neural Comput Appl – volume: 43 start-page: 100 year: 2017 end-page: 116 ident: bib0035 article-title: Customer centric production planning and control in job shops: a simulation optimization approach publication-title: J Manuf Syst – volume: 190 start-page: 398 year: 2008 end-page: 411 ident: bib0080 article-title: A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem publication-title: Eur J Oper Res – volume: 18 start-page: 416 year: 1999 end-page: 430 ident: bib0005 article-title: An approach to job shop scheduling with sequence-dependent setups publication-title: J Manuf Syst – year: 2008 ident: bib0360 article-title: Design and analysis of experiments – volume: 45 start-page: 369 year: 1990 end-page: 375 ident: bib0055 article-title: Job-shop scheduling with multi-purpose machines publication-title: Computing – volume: 31 start-page: 195 year: 2012 end-page: 203 ident: bib0030 article-title: A three-fold approach for job shop problems: a divide-and-integrate strategy with immune algorithm publication-title: J Manuf Syst – volume: 8 start-page: 1417 year: 2014 end-page: 1431 ident: bib0075 article-title: A MILP model for an extended version of the Flexible Job Shop Problem publication-title: Optim Lett – year: 2000 ident: bib0195 article-title: Effective neighborhood functions for the flexible job shop problem: appendix – volume: 42 start-page: 7652 year: 2015 end-page: 7663 ident: bib0185 article-title: A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion publication-title: Expert Syst Appl – volume: 73 start-page: 56 year: 2016 end-page: 66 ident: bib0135 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 – volume: 245 start-page: 35 year: 2015 end-page: 45 ident: bib0220 article-title: Scatter search with path relinking for the flexible job shop scheduling problem publication-title: Eur J Oper Res – volume: 79 start-page: 220 year: 1994 end-page: 229 ident: bib0315 article-title: DSS for multiobjective project scheduling publication-title: Eur J Oper Res – volume: 11 start-page: 346 year: 1992 end-page: 358 ident: bib0025 article-title: Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules publication-title: J Manuf Syst – volume: 51 start-page: 6247 year: 2013 end-page: 6274 ident: bib0110 article-title: Mathematical modelling and a meta-heuristic for flexible job shop scheduling publication-title: Int J Prod Res – volume: 23 start-page: 503 year: 2007 end-page: 516 ident: bib0155 article-title: Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method publication-title: Robot Comput Integr Manuf – volume: 247 start-page: 421 year: 2015 end-page: 440 ident: bib0070 article-title: List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility publication-title: Eur J Oper Res – volume: 32 start-page: 1 year: 2002 end-page: 13 ident: bib0145 article-title: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems publication-title: IEEE Trans Syst Man Cybernetics Part C (Appl Rev) – volume: 30 start-page: 8 year: 2011 end-page: 15 ident: bib0210 article-title: Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach publication-title: J Manuf Syst – volume: 1 start-page: 122 year: 2007 end-page: 127 ident: bib0010 article-title: Mathematical models of flow shop and job shop scheduling problems, World Academy of Science publication-title: Eng Technol – start-page: 1 year: 2016 end-page: 13 ident: bib0175 article-title: A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem publication-title: Int J Prod Res – volume: 37 start-page: 678 year: 2010 end-page: 687 ident: bib0205 article-title: Flexible job-shop scheduling with parallel variable neighborhood search algorithm publication-title: Expert Syst Appl – volume: 94 start-page: 15 year: 1994 end-page: 23 ident: bib0310 article-title: DSS for job shop machine scheduling publication-title: Ind Manag Data Syst – volume: 28 start-page: 1106 year: 2015 end-page: 1121 ident: bib0285 article-title: A chemotaxis-enhanced bacterial foraging algorithm and its application in job shop scheduling problem publication-title: Int J Comput Integr Manuf – volume: 165 start-page: 525 year: 2005 end-page: 534 ident: bib0085 article-title: A heuristic to schedule flexible job-shop in a glass factory publication-title: Eur J Oper Res – volume: 52 start-page: 43 year: 2019 end-page: 54 ident: bib0040 article-title: Bi-objective optimization for a multistate job-shop production network using NSGA-II and TOPSIS publication-title: J Manuf Syst – volume: 1 start-page: 67 year: 1997 end-page: 82 ident: bib0230 article-title: No free lunch theorems for optimization publication-title: IEEE Trans Evol Comput – start-page: 562 year: 2007 end-page: 569 ident: bib0340 article-title: Improved bacterial foraging algorithms and their applications to job shop scheduling problems publication-title: Adaptive and natural computing algorithms: 8th international conference, ICANNGA – volume: 43 start-page: 351 year: 2002 end-page: 374 ident: bib0095 article-title: Advanced planning and scheduling with outsourcing in manufacturing supply chain publication-title: Comput Ind Eng – year: 2012 ident: bib0275 article-title: A hybrid bacterial foraging algorithm for solving job shop scheduling problems – volume: 32 start-page: 771 year: 2013 end-page: 780 ident: bib0330 article-title: A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling publication-title: J Manuf Syst – volume: 22 start-page: 52 year: 2002 end-page: 67 ident: bib0225 article-title: Biomimicry of bacterial foraging for distributed optimization and control publication-title: IEEE Control Syst – start-page: 183 year: 2009 end-page: 196 ident: bib0350 article-title: Multistage-based genetic algorithm for flexible job-shop scheduling problem publication-title: Intelligent and evolutionary systems – volume: 6 start-page: 8619 year: 2018 end-page: 8629 ident: bib0245 article-title: Bacterial foraging optimization algorithm for menu planning publication-title: IEEE Access – volume: 10 start-page: 888 year: 2010 end-page: 896 ident: bib0160 article-title: A knowledge-based ant colony optimization for flexible job shop scheduling problems publication-title: Appl Soft Comput – volume: 40 start-page: 113 year: 1992 ident: 10.1016/j.jmsy.2019.11.010_bib0325 article-title: Job shop scheduling by simulated annealing publication-title: Oper Res doi: 10.1287/opre.40.1.113 – volume: 23 start-page: 551 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0235 article-title: A research survey: review of flexible job shop scheduling techniques publication-title: Int Trans Oper Res doi: 10.1111/itor.12199 – volume: 220 start-page: 671 year: 1983 ident: 10.1016/j.jmsy.2019.11.010_bib0320 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 22 start-page: 52 year: 2002 ident: 10.1016/j.jmsy.2019.11.010_bib0225 article-title: Biomimicry of bacterial foraging for distributed optimization and control publication-title: IEEE Control Syst doi: 10.1109/MCS.2002.1004010 – volume: 18 start-page: 416 year: 1999 ident: 10.1016/j.jmsy.2019.11.010_bib0005 article-title: An approach to job shop scheduling with sequence-dependent setups publication-title: J Manuf Syst doi: 10.1016/S0278-6125(00)87643-8 – volume: 31 start-page: 195 year: 2012 ident: 10.1016/j.jmsy.2019.11.010_bib0030 article-title: A three-fold approach for job shop problems: a divide-and-integrate strategy with immune algorithm publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2011.05.005 – volume: 190 start-page: 398 year: 2008 ident: 10.1016/j.jmsy.2019.11.010_bib0080 article-title: A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2007.06.039 – volume: 42 start-page: 7652 year: 2015 ident: 10.1016/j.jmsy.2019.11.010_bib0185 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: 5 start-page: 57 year: 2014 ident: 10.1016/j.jmsy.2019.11.010_bib0265 article-title: A hybrid GABFO scheduling for optimal makespan in computational grid publication-title: Int J Appl Evol Comput (IJAEC) doi: 10.4018/ijaec.2014070104 – volume: 174 start-page: 93 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0215 article-title: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2016.01.016 – volume: 25 start-page: 237 year: 2014 ident: 10.1016/j.jmsy.2019.11.010_bib0260 article-title: Bacterial Foraging Optimization Algorithm for assembly line balancing publication-title: Neural Comput Appl doi: 10.1007/s00521-013-1477-9 – start-page: 3018 year: 2006 ident: 10.1016/j.jmsy.2019.11.010_bib0180 article-title: Solving flexible job shop scheduling problem using general particle swarm optimization – volume: 18 start-page: 284 year: 1999 ident: 10.1016/j.jmsy.2019.11.010_bib0045 article-title: An effective optimization-based algorithm for job shop scheduling with fixed-size transfer lots publication-title: J Manuf Syst doi: 10.1016/S0278-6125(00)86631-5 – volume: 8 start-page: 1417 year: 2014 ident: 10.1016/j.jmsy.2019.11.010_bib0075 article-title: A MILP model for an extended version of the Flexible Job Shop Problem publication-title: Optim Lett doi: 10.1007/s11590-013-0669-7 – volume: 15 start-page: 205 year: 1994 ident: 10.1016/j.jmsy.2019.11.010_bib0190 article-title: Tabu search for the job-shop scheduling problem with multi-purpose machines publication-title: Operations-Res-Spektrum doi: 10.1007/BF01719451 – volume: 12 start-page: 315 year: 1993 ident: 10.1016/j.jmsy.2019.11.010_bib0050 article-title: Two-stage heuristic procedure for scheduling job shops publication-title: J Manuf Syst doi: 10.1016/0278-6125(93)90322-K – volume: 41 start-page: 157 year: 1993 ident: 10.1016/j.jmsy.2019.11.010_bib0065 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Ann Oper Res doi: 10.1007/BF02023073 – volume: 32 start-page: 689 year: 2013 ident: 10.1016/j.jmsy.2019.11.010_bib0020 article-title: Recurrent neural network approach for cyclic job shop scheduling problem publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2013.02.001 – volume: 179 start-page: 709 year: 2007 ident: 10.1016/j.jmsy.2019.11.010_bib0290 article-title: A multi-objective production scheduling case study solved by simulated annealing publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.03.073 – volume: 245 start-page: 35 year: 2015 ident: 10.1016/j.jmsy.2019.11.010_bib0220 article-title: Scatter search with path relinking for the flexible job shop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.02.052 – volume: 52 start-page: 43 year: 2019 ident: 10.1016/j.jmsy.2019.11.010_bib0040 article-title: Bi-objective optimization for a multistate job-shop production network using NSGA-II and TOPSIS publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2019.05.004 – volume: 43 start-page: 351 year: 2002 ident: 10.1016/j.jmsy.2019.11.010_bib0095 article-title: Advanced planning and scheduling with outsourcing in manufacturing supply chain publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(02)00079-7 – volume: 73 start-page: 56 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0135 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 – start-page: 1 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0175 article-title: A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem publication-title: Int J Prod Res – volume: 94 start-page: 15 year: 1994 ident: 10.1016/j.jmsy.2019.11.010_bib0310 article-title: DSS for job shop machine scheduling publication-title: Ind Manag Data Syst doi: 10.1108/02635579410059455 – volume: 83 start-page: 1 year: 2017 ident: 10.1016/j.jmsy.2019.11.010_bib0255 article-title: A novel bacterial foraging optimization algorithm for feature selection publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2017.04.019 – volume: 172 start-page: 104 year: 2019 ident: 10.1016/j.jmsy.2019.11.010_bib0270 article-title: Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2019.02.016 – volume: 6 start-page: 8619 year: 2018 ident: 10.1016/j.jmsy.2019.11.010_bib0245 article-title: Bacterial foraging optimization algorithm for menu planning publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2794198 – volume: 40 start-page: 2864 year: 2013 ident: 10.1016/j.jmsy.2019.11.010_bib0365 article-title: An integrated search heuristic for large-scale flexible job shop scheduling problems publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.06.010 – volume: 62 start-page: 602 year: 2018 ident: 10.1016/j.jmsy.2019.11.010_bib0250 article-title: Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2017.10.034 – volume: 28 start-page: 1106 year: 2015 ident: 10.1016/j.jmsy.2019.11.010_bib0285 article-title: A chemotaxis-enhanced bacterial foraging algorithm and its application in job shop scheduling problem publication-title: Int J Comput Integr Manuf – volume: 35 start-page: 3202 year: 2008 ident: 10.1016/j.jmsy.2019.11.010_bib0125 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 – year: 2008 ident: 10.1016/j.jmsy.2019.11.010_bib0360 – volume: 1 start-page: 67 year: 1997 ident: 10.1016/j.jmsy.2019.11.010_bib0230 article-title: No free lunch theorems for optimization publication-title: IEEE Trans Evol Comput doi: 10.1109/4235.585893 – volume: 51 start-page: 6247 year: 2013 ident: 10.1016/j.jmsy.2019.11.010_bib0110 article-title: Mathematical modelling and a meta-heuristic for flexible job shop scheduling publication-title: Int J Prod Res doi: 10.1080/00207543.2013.827806 – volume: 98 start-page: 93 year: 2018 ident: 10.1016/j.jmsy.2019.11.010_bib0240 article-title: A new hybrid heuristic algorithm based on bacterial foraging optimization for the dynamic facility layout problem publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2018.01.011 – volume: 30 start-page: 8 year: 2011 ident: 10.1016/j.jmsy.2019.11.010_bib0210 article-title: Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2011.02.004 – start-page: 183 year: 2009 ident: 10.1016/j.jmsy.2019.11.010_bib0350 article-title: Multistage-based genetic algorithm for flexible job-shop scheduling problem – year: 2012 ident: 10.1016/j.jmsy.2019.11.010_bib0275 – volume: 23 start-page: 503 year: 2007 ident: 10.1016/j.jmsy.2019.11.010_bib0155 article-title: Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method publication-title: Robot Comput Integr Manuf doi: 10.1016/j.rcim.2006.06.004 – volume: 33 start-page: 3076 year: 2009 ident: 10.1016/j.jmsy.2019.11.010_bib0295 article-title: Flexible job shop scheduling with overlapping in operations publication-title: Appl Math Model doi: 10.1016/j.apm.2008.10.029 – start-page: 562 year: 2007 ident: 10.1016/j.jmsy.2019.11.010_bib0340 article-title: Improved bacterial foraging algorithms and their applications to job shop scheduling problems – volume: 37 start-page: 678 year: 2010 ident: 10.1016/j.jmsy.2019.11.010_bib0205 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: 10 start-page: 607 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0345 article-title: Improved modified bacterial foraging optimization algorithm to solve constrained numerical optimization problems publication-title: Appl Math Inf Sci doi: 10.18576/amis/100220 – volume: 34 start-page: 1539 year: 2010 ident: 10.1016/j.jmsy.2019.11.010_bib0105 article-title: Mathematical models for job-shop scheduling problems with routing and process plan flexibility publication-title: Appl Math Model doi: 10.1016/j.apm.2009.09.002 – volume: 12 start-page: 7 issue: 10 year: 2012 ident: 10.1016/j.jmsy.2019.11.010_bib0280 article-title: A hybrid bacterial swarming methodology for job shop scheduling environment publication-title: Glob J Comput Sci Technol – volume: 18 start-page: 331 year: 2007 ident: 10.1016/j.jmsy.2019.11.010_bib0100 article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems publication-title: J Intell Manuf doi: 10.1007/s10845-007-0026-8 – volume: 32 start-page: 1 year: 2002 ident: 10.1016/j.jmsy.2019.11.010_bib0145 article-title: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems publication-title: IEEE Trans Syst Man Cybernetics Part C (Appl Rev) doi: 10.1109/TSMCC.2002.1009117 – volume: 10 start-page: 888 year: 2010 ident: 10.1016/j.jmsy.2019.11.010_bib0160 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: 11 start-page: 346 year: 1992 ident: 10.1016/j.jmsy.2019.11.010_bib0025 article-title: Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules publication-title: J Manuf Syst doi: 10.1016/0278-6125(92)90063-L – year: 2000 ident: 10.1016/j.jmsy.2019.11.010_bib0195 – volume: 43 start-page: 100 year: 2017 ident: 10.1016/j.jmsy.2019.11.010_bib0035 article-title: Customer centric production planning and control in job shops: a simulation optimization approach publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2017.02.004 – year: 2009 ident: 10.1016/j.jmsy.2019.11.010_bib0355 – volume: 1 start-page: 117 year: 1976 ident: 10.1016/j.jmsy.2019.11.010_bib0120 article-title: The complexity of flowshop and jobshop scheduling publication-title: Math Oper Res doi: 10.1287/moor.1.2.117 – volume: 45 start-page: 369 year: 1990 ident: 10.1016/j.jmsy.2019.11.010_bib0055 article-title: Job-shop scheduling with multi-purpose machines publication-title: Computing doi: 10.1007/BF02238804 – volume: 165 start-page: 525 year: 2005 ident: 10.1016/j.jmsy.2019.11.010_bib0085 article-title: A heuristic to schedule flexible job-shop in a glass factory publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2004.04.020 – volume: 52 start-page: 3905 year: 2014 ident: 10.1016/j.jmsy.2019.11.010_bib0140 article-title: An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations publication-title: Int J Prod Res doi: 10.1080/00207543.2014.889328 – year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0300 – volume: 179 start-page: 316 year: 2007 ident: 10.1016/j.jmsy.2019.11.010_bib0150 article-title: An effective architecture for learning and evolving flexible job-shop schedules publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.04.007 – volume: 1 start-page: 122 year: 2007 ident: 10.1016/j.jmsy.2019.11.010_bib0010 article-title: Mathematical models of flow shop and job shop scheduling problems, World Academy of Science publication-title: Eng Technol – volume: 60 start-page: 245 year: 2002 ident: 10.1016/j.jmsy.2019.11.010_bib0060 article-title: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic publication-title: Math Comput Simul doi: 10.1016/S0378-4754(02)00019-8 – volume: 45 start-page: 71 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0305 article-title: An object-oriented approach for multi-objective flexible job-shop scheduling problem publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2015.09.050 – volume: 48 start-page: 409 year: 2005 ident: 10.1016/j.jmsy.2019.11.010_bib0335 article-title: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems publication-title: Comput Ind Eng doi: 10.1016/j.cie.2005.01.018 – volume: 55 start-page: 341 year: 2016 ident: 10.1016/j.jmsy.2019.11.010_bib0015 article-title: Robust job shop scheduling problem: mathematical models, exact and heuristic algorithms publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2016.01.054 – volume: 20 start-page: 214 year: 2002 ident: 10.1016/j.jmsy.2019.11.010_bib0090 article-title: Scheduling of flexible-sequenced process plans in a mould manufacturing shop publication-title: Int J Adv Manuf Technol doi: 10.1007/s001700200144 – volume: 265 start-page: 503 year: 2018 ident: 10.1016/j.jmsy.2019.11.010_bib0115 article-title: Solving the flexible job shop scheduling problem with sequence-dependent setup times publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.08.021 – volume: 200 start-page: 395 year: 2010 ident: 10.1016/j.jmsy.2019.11.010_bib0130 article-title: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2009.01.008 – volume: 247 start-page: 421 year: 2015 ident: 10.1016/j.jmsy.2019.11.010_bib0070 article-title: List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.06.023 – volume: 141 start-page: 685 year: 2013 ident: 10.1016/j.jmsy.2019.11.010_bib0165 article-title: Flexible job shop scheduling with due window—a two-pheromone ant colony approach publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2012.10.011 – volume: 48 start-page: 5671 year: 2010 ident: 10.1016/j.jmsy.2019.11.010_bib0200 article-title: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem publication-title: Int J Prod Res doi: 10.1080/00207540903055743 – volume: 79 start-page: 220 year: 1994 ident: 10.1016/j.jmsy.2019.11.010_bib0315 article-title: DSS for multiobjective project scheduling publication-title: Eur J Oper Res doi: 10.1016/0377-2217(94)90353-0 – volume: 60 start-page: 303 year: 2012 ident: 10.1016/j.jmsy.2019.11.010_bib0170 article-title: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-011-3610-1 – volume: 32 start-page: 771 year: 2013 ident: 10.1016/j.jmsy.2019.11.010_bib0330 article-title: A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling publication-title: J Manuf Syst doi: 10.1016/j.jmsy.2013.04.015 |
| SSID | ssj0012402 |
| Score | 2.440582 |
| Snippet | •A mathematical model is developed for the flexible job-shop scheduling problem (FSJP) with sequencing flexibility.•A novel hybrid bacterial foraging... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 74 |
| SubjectTerms | Bacterial foraging optimization algorithm Decision support system Flexible job-shop scheduling problem Sequencing-flexibility Simulated annealing Weighted tardiness |
| Title | Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility |
| URI | https://dx.doi.org/10.1016/j.jmsy.2019.11.010 |
| Volume | 54 |
| WOSCitedRecordID | wos000521511500007&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1878-6642 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012402 issn: 0278-6125 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1ba9swFBZZuoftYezKuht62Jtx8d3WYxgt26Bl0A7yZiRFnmNiOyRuafNP9n_2w3aOJV_SjbIN9mKCEtlG54v0Hel85xDyPo6567vewmaBEHYgY2YnymF2qESsgN9Kl-liE_HZWTKfsy-TyY9OC3O1iqsqub5m6_9qamgDY6N09i_M3d8UGuAzGB2uYHa4_pHhT_tErCgMwUI3nQ6RW_kNCrSWO6SdOk2z1i-aUkUwfZRGl2nx1bd6s2zysg9EzDB3JgqtilrY27xeW-AZw0plBO1tYRoT8q7js9sgzbYTBuDunR-PeHDJq0uUV2i95HaUQR3rgGFNE_u8bjo1TsExw0IP0x1vz5NmeWlEWu2mrC7FfVrnuC2_sE74zgyR2d7wnFvbG73uZghywqnRA98XuZlexfTUnWBbFOzN7WEwmpx1OSCzzOu6jL8sIHovozgqyu0NBv6xI8zxaiJv9xNzn-NbtASR-Ui0k3vkwItDlkzJwezT8fxzf5qFJ1jtXp95ayPe0nGGt5_0e4I0Ij0Xj8kjYyU60yh7QiaqekoejnJYPiPfx3ijHd4omIlyOuCN9nijHd7oGG-0xxt-T-GWtMMb7fBGB7xRgzeKeKMD3ugIb8_J15Pjiw8fbVPvw5YwgI2thPSAvfuMO5GIAuVyLqTDM5l5PIiFj66uw10WKC_zQwmOSBIJpTiLFaxTUvovyLSqK_WSUJVFiyCUDvOAIitPMOEJP_DBP2ZJJkN5SNxukFNpkuFjTZZV2kU9FikaJkXDgJecgmEOidX3WetUMHf-Ouxslxoyq0lqClC7o9-rf-z3mjwY_j5vyLTZXKq35L68apbbzTuDyJ_Xz88n |
| linkProvider | Elsevier |
| 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=Mathematical+modeling+and+a+hybridized+bacterial+foraging+optimization+algorithm+for+the+flexible+job-shop+scheduling+problem+with+sequencing+flexibility&rft.jtitle=Journal+of+manufacturing+systems&rft.au=Vital-Soto%2C+Alejandro&rft.au=Azab%2C+Ahmed&rft.au=Baki%2C+Mohammed+Fazle&rft.date=2020-01-01&rft.pub=Elsevier+Ltd&rft.issn=0278-6125&rft.eissn=1878-6642&rft.volume=54&rft.spage=74&rft.epage=93&rft_id=info:doi/10.1016%2Fj.jmsy.2019.11.010&rft.externalDocID=S0278612519300998 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0278-6125&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0278-6125&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0278-6125&client=summon |