Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times
•Developed dynamic waiting time calculation approach (DWC).•Developed machine selection heuristics.•Proposed memetic framework that integrate iterated greedy (IG) algorithm with machine selection heuristics. Flexible flow-shop scheduling with dynamic transport waiting times (FFSPDW) is a typical flo...
Uložené v:
| Vydané v: | Computers & industrial engineering Ročník 139; s. 105984 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.01.2020
|
| Predmet: | |
| ISSN: | 0360-8352, 1879-0550 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Developed dynamic waiting time calculation approach (DWC).•Developed machine selection heuristics.•Proposed memetic framework that integrate iterated greedy (IG) algorithm with machine selection heuristics.
Flexible flow-shop scheduling with dynamic transport waiting times (FFSPDW) is a typical flow shop scheduling problem in smart manufacturing system. In this problem, jobs need to be transported by transporters like AGV (Automated Guided Vehicle) to next stage after processing. During transportation, waiting time dynamically occurs for both jobs and transporters, and finally contributes to makespan. The waiting times are conditioned by buffer capacity, machine allocations and production sequence. In order to minimize makespan with consideration of dynamic waiting times, we proposed a waiting time calculation approach to evaluate waiting time and makespan. This approach considers two situations: infinite buffer capacity and zero buffer capacity. Further, we developed a memetic algorithm integrated with waiting time calculation approach to solve FFSPDW. Finally, we verified the algorithm parameters via analysis of variance. Computational results show that the proposed memetic algorithm is able to reach high quality solutions with short computation time. Consequently, the proposed approach is suitable for solving industrial FFSPDW problems. |
|---|---|
| AbstractList | •Developed dynamic waiting time calculation approach (DWC).•Developed machine selection heuristics.•Proposed memetic framework that integrate iterated greedy (IG) algorithm with machine selection heuristics.
Flexible flow-shop scheduling with dynamic transport waiting times (FFSPDW) is a typical flow shop scheduling problem in smart manufacturing system. In this problem, jobs need to be transported by transporters like AGV (Automated Guided Vehicle) to next stage after processing. During transportation, waiting time dynamically occurs for both jobs and transporters, and finally contributes to makespan. The waiting times are conditioned by buffer capacity, machine allocations and production sequence. In order to minimize makespan with consideration of dynamic waiting times, we proposed a waiting time calculation approach to evaluate waiting time and makespan. This approach considers two situations: infinite buffer capacity and zero buffer capacity. Further, we developed a memetic algorithm integrated with waiting time calculation approach to solve FFSPDW. Finally, we verified the algorithm parameters via analysis of variance. Computational results show that the proposed memetic algorithm is able to reach high quality solutions with short computation time. Consequently, the proposed approach is suitable for solving industrial FFSPDW problems. |
| ArticleNumber | 105984 |
| Author | Ye, Song Lei, Chuanjin Zhao, Ning Wu, Xiuli |
| Author_xml | – sequence: 1 givenname: Chuanjin surname: Lei fullname: Lei, Chuanjin – sequence: 2 givenname: Ning orcidid: 0000-0001-9720-1746 surname: Zhao fullname: Zhao, Ning email: nickzhao@me.ustb.edu.cn – sequence: 3 givenname: Song surname: Ye fullname: Ye, Song – sequence: 4 givenname: Xiuli surname: Wu fullname: Wu, Xiuli |
| BookMark | eNp9kM1OwzAQhC0EEm3hAbj5BRLWSfMnTqjiTyriAmfLsdetqySObNPSt8dROXHoaVea-UaamZPLwQ5IyB2DlAEr73epNJhmwJoUqhSW7ILMWF01CRQFXJIZ5CUkdV5k12Tu_Q4AlkXDZsS8Y4_BSCq6jXUmbHuqraPednszbKju8Me0HcbHHhK_tSP1covqu5vU0dmo9Z4eIkjVcRB9TApODH60LtCDMGHyBdOjvyFXWnQeb__ugnw9P32uXpP1x8vb6nGdyKypQiJlKzCHEmWps2Ur2joTdS4bxXSLgFXRqAozEE3b5pnQWBSq1CUozEqoclbnC8JOudJZ7x1qPjrTC3fkDPi0Fd_xuBWftuJQ8bhVZKp_jDRBBGOHWMZ0Z8mHE4mx0t6g4z5aBonKOJSBK2vO0L__xYnb |
| CitedBy_id | crossref_primary_10_1016_j_cie_2022_108672 crossref_primary_10_1109_TASE_2021_3062994 crossref_primary_10_1016_j_cie_2025_110938 crossref_primary_10_1016_j_aei_2025_103195 crossref_primary_10_1080_00207543_2024_2373426 crossref_primary_10_1080_21681015_2024_2337029 crossref_primary_10_1016_j_eswa_2023_119512 crossref_primary_10_3390_sym14071424 crossref_primary_10_1016_j_ins_2023_119949 crossref_primary_10_1111_itor_13108 crossref_primary_10_1080_0305215X_2024_2437004 crossref_primary_10_1016_j_eswa_2023_120846 crossref_primary_10_1016_j_jmsy_2022_10_016 crossref_primary_10_3390_app132111896 crossref_primary_10_1016_j_cor_2025_107145 crossref_primary_10_7717_peerj_cs_2168 crossref_primary_10_1016_j_swevo_2025_102007 crossref_primary_10_1016_j_eswa_2024_125175 crossref_primary_10_1007_s10586_024_04803_x crossref_primary_10_1016_j_ejor_2023_10_013 crossref_primary_10_3390_app15136995 crossref_primary_10_1016_j_knosys_2023_110968 crossref_primary_10_1061_JCEMD4_COENG_15909 crossref_primary_10_1016_j_cie_2024_110686 crossref_primary_10_1016_j_cie_2022_108786 crossref_primary_10_1016_j_eswa_2022_117460 crossref_primary_10_1016_j_jmsy_2024_08_007 crossref_primary_10_1016_j_aei_2024_102804 crossref_primary_10_1016_j_eswa_2023_120807 crossref_primary_10_1016_j_asoc_2024_112230 crossref_primary_10_1007_s11424_023_2491_3 crossref_primary_10_1016_j_cie_2020_106938 crossref_primary_10_1109_TASE_2023_3346446 crossref_primary_10_3390_app14198793 crossref_primary_10_1007_s12008_023_01414_5 crossref_primary_10_1016_j_asoc_2024_112689 crossref_primary_10_1016_j_cor_2024_106687 crossref_primary_10_1016_j_swevo_2025_101902 crossref_primary_10_1109_ACCESS_2021_3112742 crossref_primary_10_3390_pr11092737 crossref_primary_10_1080_0305215X_2022_2141236 crossref_primary_10_1016_j_eswa_2024_124194 crossref_primary_10_1177_03611981221143116 crossref_primary_10_1109_ACCESS_2023_3285710 |
| Cites_doi | 10.1016/j.cor.2009.11.001 10.1016/j.engappai.2016.10.013 10.1016/j.ins.2018.03.047 10.1016/j.ejor.2005.08.034 10.1080/0951192X.2016.1210231 10.1080/07408170590918290 10.1016/j.ejor.2005.12.009 10.1016/j.eswa.2008.09.063 10.1016/j.ejor.2004.06.038 10.1057/palgrave.jors.2602625 10.1016/j.cie.2016.08.006 10.1023/B:ANOR.0000030683.64615.c8 10.1016/0377-2217(94)00235-5 10.1080/07408179108963836 10.1080/0951192X.2013.874576 10.1007/s00170-007-1104-y 10.1016/j.cie.2016.11.020 10.1016/j.ejor.2009.09.024 10.15807/jorsj.24.136 10.1007/s10033-017-0108-2 10.1002/1099-1425(200101/02)4:1<3::AID-JOS57>3.0.CO;2-D 10.1051/ro:2000103 10.1287/mnsc.37.5.587 10.1016/j.ejor.2003.03.002 10.1080/002075497195948 10.1057/jors.2012.184 10.1016/j.asoc.2015.11.008 10.4028/www.scientific.net/AMM.65.574 |
| ContentType | Journal Article |
| Copyright | 2019 |
| Copyright_xml | – notice: 2019 |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cie.2019.07.041 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EISSN | 1879-0550 |
| ExternalDocumentID | 10_1016_j_cie_2019_07_041 S0360835219304322 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADGUI ADMUD ADRHT ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-ccbae306ec6f24bab82a83c9d1fbe0e759d7e20a9bb32afe55d6f60de26073183 |
| ISICitedReferencesCount | 58 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000509784000057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0360-8352 |
| IngestDate | Sat Nov 29 07:18:39 EST 2025 Tue Nov 18 21:09:38 EST 2025 Fri Feb 23 02:48:54 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Flexible flow-shop scheduling Integrated scheduling Iterated greedy algorithm Makespan Dynamic waiting times |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-ccbae306ec6f24bab82a83c9d1fbe0e759d7e20a9bb32afe55d6f60de26073183 |
| ORCID | 0000-0001-9720-1746 |
| ParticipantIDs | crossref_primary_10_1016_j_cie_2019_07_041 crossref_citationtrail_10_1016_j_cie_2019_07_041 elsevier_sciencedirect_doi_10_1016_j_cie_2019_07_041 |
| PublicationCentury | 2000 |
| PublicationDate | January 2020 2020-01-00 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – month: 01 year: 2020 text: January 2020 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2020 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Elmi, Topaloglu (b0030) 2014; 27 Ribas, Leisten, Framiñan (b0105) 2010; 37 Ruizab (b0125) 2010; 205 Xiao, Hao, Zhang, Xu (b0155) 2002 Yuan, Soukhal, Chen, Lu (b0180) 2007; 178 Maggu, Das (b0080) 1980; 12 Ruizab (b0120) 2007; 177 Batur, Erol, Karasan (b0005) 2016; 100 Conway, Maxwell, Miller (b0025) 2003 Ying (b0175) 2009; 60 Elmi, Topaloglu (b0035) 2016; 30 Zhao, Ye, Li, Chen (b0195) 2017; 30 Brucker, Knust, Cheng, Shakhlevich (b0010) 2004; 129 Jin-Wei, Man-Zhan, Xing-Sheng (b0050) 2014; 40 Ruiz, Maroto (b0110) 2007; 169 Lee, Strusevich (b0065) 2005; 37 Maggu, Das, Kumar (b0085) 1981; 24 Shang, Lining, Ling, Kai (b0130) 2017; 60 Koç, Toptal, Sabuncuoglu (b0060) 2017; 103 Toptal, Koc, Sabuncuoglu (b0145) 2014; 65 Ling (b0070) 2003 Soukhal, Oulamara, Martineau (b0135) 2005; 161 Elmi, Topaloglu (b0040) 2017; 30 Chung-Yee, Chen (b0020) 2001; 4 Carlier, Neron, Emmanuel (b0015) 2000; 34 Stevens, Gemmill (b0140) 1997; 35 Hoogeveen, Lenstra, Veltman (b0045) 1996; 89 Kise, Shioyama, Ibaraki (b0055) 1991; 23 Yi, Xing, Wang, Dong, Vasilakos, Alavi, Wang (b0165) 2018 Lu, Gao, Li, Xiao (b0075) 2017; 57 Ruiz, Stützle (b0115) 2007; 177 Naderi, Zandieh, Khaleghi, Roshanaei (b0095) 2009; 36 Wang, Lai, Wu, Xing, Wang, Ishibuchi (b0150) 2018; 450 Xuan (b0160) 2011; 65 Matsuo, Shang, Sullivan (b0090) 1991; 37 Ying (b0170) 2008; 38 Ribas, Leisten, Framinan (b0100) 2010; 37 Zhang, Rose (b0190) 2013 Zabihzadeh, Rezaeian (b0185) 2016; 40 Ruizab (10.1016/j.cie.2019.07.041_b0120) 2007; 177 Chung-Yee (10.1016/j.cie.2019.07.041_b0020) 2001; 4 Maggu (10.1016/j.cie.2019.07.041_b0085) 1981; 24 Elmi (10.1016/j.cie.2019.07.041_b0040) 2017; 30 Toptal (10.1016/j.cie.2019.07.041_b0145) 2014; 65 Zhao (10.1016/j.cie.2019.07.041_b0195) 2017; 30 Ling (10.1016/j.cie.2019.07.041_b0070) 2003 Ruiz (10.1016/j.cie.2019.07.041_b0110) 2007; 169 Ruizab (10.1016/j.cie.2019.07.041_b0125) 2010; 205 Hoogeveen (10.1016/j.cie.2019.07.041_b0045) 1996; 89 Lu (10.1016/j.cie.2019.07.041_b0075) 2017; 57 Conway (10.1016/j.cie.2019.07.041_b0025) 2003 Ribas (10.1016/j.cie.2019.07.041_b0100) 2010; 37 Ying (10.1016/j.cie.2019.07.041_b0175) 2009; 60 Lee (10.1016/j.cie.2019.07.041_b0065) 2005; 37 Carlier (10.1016/j.cie.2019.07.041_b0015) 2000; 34 Shang (10.1016/j.cie.2019.07.041_b0130) 2017; 60 Matsuo (10.1016/j.cie.2019.07.041_b0090) 1991; 37 Maggu (10.1016/j.cie.2019.07.041_b0080) 1980; 12 Wang (10.1016/j.cie.2019.07.041_b0150) 2018; 450 Ribas (10.1016/j.cie.2019.07.041_b0105) 2010; 37 Batur (10.1016/j.cie.2019.07.041_b0005) 2016; 100 Soukhal (10.1016/j.cie.2019.07.041_b0135) 2005; 161 Xuan (10.1016/j.cie.2019.07.041_b0160) 2011; 65 Ying (10.1016/j.cie.2019.07.041_b0170) 2008; 38 Yuan (10.1016/j.cie.2019.07.041_b0180) 2007; 178 Elmi (10.1016/j.cie.2019.07.041_b0030) 2014; 27 Xiao (10.1016/j.cie.2019.07.041_b0155) 2002 Koç (10.1016/j.cie.2019.07.041_b0060) 2017; 103 Yi (10.1016/j.cie.2019.07.041_b0165) 2018 Jin-Wei (10.1016/j.cie.2019.07.041_b0050) 2014; 40 Kise (10.1016/j.cie.2019.07.041_b0055) 1991; 23 Zabihzadeh (10.1016/j.cie.2019.07.041_b0185) 2016; 40 Brucker (10.1016/j.cie.2019.07.041_b0010) 2004; 129 Elmi (10.1016/j.cie.2019.07.041_b0035) 2016; 30 Ruiz (10.1016/j.cie.2019.07.041_b0115) 2007; 177 Naderi (10.1016/j.cie.2019.07.041_b0095) 2009; 36 Zhang (10.1016/j.cie.2019.07.041_b0190) 2013 Stevens (10.1016/j.cie.2019.07.041_b0140) 1997; 35 |
| References_xml | – volume: 100 start-page: 72 year: 2016 end-page: 87 ident: b0005 article-title: Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells publication-title: Computers & Industrial Engineering – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: b0115 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research – volume: 37 start-page: 1439 year: 2010 end-page: 1454 ident: b0105 article-title: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective publication-title: Computers & Operations Research – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: b0120 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research – volume: 36 start-page: 9625 year: 2009 end-page: 9633 ident: b0095 article-title: An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness publication-title: Expert Systems with Applications – volume: 450 start-page: 128 year: 2018 end-page: 140 ident: b0150 article-title: Multi-clustering via evolutionary multi-objective optimization publication-title: Information Sciences – start-page: 2633 year: 2013 end-page: 2642 ident: b0190 article-title: Simulation-based overhead-crane scheduling for a manufacturing plant publication-title: Proceedings of the 2013 winter simulation conference: Simulation: Making decisions in a complex world – volume: 30 start-page: 652 year: 2017 end-page: 662 ident: b0195 article-title: Effective iterated greedy algorithm for flow-shop scheduling problems with time lags publication-title: Chinese Journal of Mechanical Engineering – volume: 4 start-page: 3 year: 2001 end-page: 24 ident: b0020 article-title: Machine scheduling with transportation considerations publication-title: Journal of Scheduling – year: 2003 ident: b0070 article-title: Shop scheduling with genetic algorithms – volume: 178 start-page: 918 year: 2007 end-page: 925 ident: b0180 article-title: A note on the complexity of flow shop scheduling with transportation constraints publication-title: European Journal of Operational Research – volume: 60 start-page: 810 year: 2009 end-page: 817 ident: b0175 article-title: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks publication-title: Journal of the Operational Research Society – volume: 34 start-page: 1 year: 2000 end-page: 25 ident: b0015 article-title: An exact method for solving the multi-processor flow-shop publication-title: RAIRO - Operations Research – volume: 40 start-page: 319 year: 2016 end-page: 330 ident: b0185 article-title: Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time publication-title: Applied Soft Computing – volume: 23 start-page: 10 year: 1991 end-page: 16 ident: b0055 article-title: Automated two-machine flowshop scheduling: A solvable case publication-title: IIE Transactions – year: 2003 ident: b0025 article-title: Theory of scheduling – volume: 205 start-page: 1 year: 2010 end-page: 18 ident: b0125 article-title: The hybrid flow shop scheduling problem publication-title: European Journal of Operational Research – year: 2018 ident: b0165 article-title: Behavior of crossover operators in NSGA-III for large-scale optimization problems publication-title: Information Sciences – volume: 37 start-page: 725 year: 2005 end-page: 736 ident: b0065 article-title: Two-machine shop scheduling with an uncapacitated interstage transporter publication-title: IIE Transactions – volume: 129 start-page: 81 year: 2004 end-page: 106 ident: b0010 article-title: Complexity results for flow-shop and open-shop scheduling problems with transportation delays publication-title: Annals of Operations Research – volume: 65 start-page: 574 year: 2011 end-page: 578 ident: b0160 article-title: Hybrid flowshop scheduling with finite transportation capacity publication-title: Applied Mechanics & Materials – volume: 38 start-page: 348 year: 2008 ident: b0170 article-title: Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic publication-title: International Journal of Advanced Manufacturing Technology – start-page: pp year: 2002 ident: b0155 article-title: Hybrid flow shop scheduling using genetic algorithms publication-title: World Congress on Intelligent Control & Automation – volume: 57 start-page: 61 year: 2017 end-page: 79 ident: b0075 article-title: A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry publication-title: Engineering Applications of Artificial Intelligence – volume: 37 start-page: 587 year: 1991 end-page: 606 ident: b0090 article-title: A crane scheduling problem in a computer-integrated manufacturing environment publication-title: Management Science – volume: 60 start-page: 425 year: 2017 ident: b0130 article-title: Comprehensive learning pigeon-inspired optimization with tabu list publication-title: SCIENCE CHINA Technological Sciences – volume: 35 start-page: 1 year: 1997 end-page: 15 ident: b0140 article-title: Scheduling a two-machine flowshop with travel times to minimize maximum lateness publication-title: International Journal of Production Research – volume: 24 start-page: 136 year: 1981 end-page: 146 ident: b0085 article-title: On equivalent-job for job-block in 2timesn sequencing problem with transportation-times publication-title: Journal of the Operations Research Society of Japan – volume: 37 start-page: 1439 year: 2010 end-page: 1454 ident: b0100 article-title: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective publication-title: Computers & Operations Research – volume: 12 start-page: 574 year: 1980 end-page: 583 ident: b0080 article-title: On $2times n$ sequencing problem with transportation times of jobs publication-title: American Journal of Industrial Medicine – volume: 161 start-page: 32 year: 2005 end-page: 41 ident: b0135 article-title: Complexity of flow shop scheduling problems with transportation constraints publication-title: European Journal of Operational Research – volume: 65 start-page: 180 year: 2014 end-page: 196 ident: b0145 article-title: A joint production and transportation planning problem with heterogeneous vehicles publication-title: Journal of the Operational Research Society – volume: 27 start-page: 1144 year: 2014 end-page: 1159 ident: b0030 article-title: Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot publication-title: International Journal of Computer Integrated Manufacturing – volume: 40 start-page: 235 year: 2014 end-page: 243 ident: b0050 article-title: A quantum bio-parasitic genetic algorithm for solving a hybrid scheduling problem of flow shop and two-stage transportation publication-title: Journal of East China University of Science & Technology – volume: 169 start-page: 781 year: 2007 end-page: 800 ident: b0110 article-title: A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility publication-title: European Journal of Operational Research – volume: 30 start-page: 805 year: 2016 end-page: 821 ident: b0035 article-title: Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization publication-title: International Journal of Computer Integrated Manufacturing – volume: 30 start-page: 805 year: 2017 end-page: 821 ident: b0040 article-title: Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots publication-title: International Journal of Computer Integrated Manufacturing – volume: 89 start-page: 172 year: 1996 end-page: 175 ident: b0045 article-title: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard publication-title: European Journal of Operational Research – volume: 103 start-page: 178 year: 2017 end-page: 192 ident: b0060 article-title: Coordination of inbound and outbound transportation schedules with the production schedule publication-title: Computers & Industrial Engineering – volume: 37 start-page: 1439 year: 2010 ident: 10.1016/j.cie.2019.07.041_b0105 article-title: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.11.001 – volume: 57 start-page: 61 year: 2017 ident: 10.1016/j.cie.2019.07.041_b0075 article-title: A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2016.10.013 – volume: 450 start-page: 128 year: 2018 ident: 10.1016/j.cie.2019.07.041_b0150 article-title: Multi-clustering via evolutionary multi-objective optimization publication-title: Information Sciences doi: 10.1016/j.ins.2018.03.047 – volume: 178 start-page: 918 year: 2007 ident: 10.1016/j.cie.2019.07.041_b0180 article-title: A note on the complexity of flow shop scheduling with transportation constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.08.034 – volume: 30 start-page: 805 year: 2016 ident: 10.1016/j.cie.2019.07.041_b0035 article-title: Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2016.1210231 – start-page: pp year: 2002 ident: 10.1016/j.cie.2019.07.041_b0155 article-title: Hybrid flow shop scheduling using genetic algorithms publication-title: World Congress on Intelligent Control & Automation – volume: 37 start-page: 725 year: 2005 ident: 10.1016/j.cie.2019.07.041_b0065 article-title: Two-machine shop scheduling with an uncapacitated interstage transporter publication-title: IIE Transactions doi: 10.1080/07408170590918290 – volume: 177 start-page: 2033 year: 2007 ident: 10.1016/j.cie.2019.07.041_b0120 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.009 – volume: 36 start-page: 9625 year: 2009 ident: 10.1016/j.cie.2019.07.041_b0095 article-title: An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2008.09.063 – volume: 169 start-page: 781 year: 2007 ident: 10.1016/j.cie.2019.07.041_b0110 article-title: A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.06.038 – volume: 60 start-page: 810 year: 2009 ident: 10.1016/j.cie.2019.07.041_b0175 article-title: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602625 – volume: 100 start-page: 72 year: 2016 ident: 10.1016/j.cie.2019.07.041_b0005 article-title: Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.08.006 – volume: 12 start-page: 574 year: 1980 ident: 10.1016/j.cie.2019.07.041_b0080 article-title: On $2times n$ sequencing problem with transportation times of jobs publication-title: American Journal of Industrial Medicine – volume: 30 start-page: 805 year: 2017 ident: 10.1016/j.cie.2019.07.041_b0040 article-title: Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2016.1210231 – volume: 129 start-page: 81 year: 2004 ident: 10.1016/j.cie.2019.07.041_b0010 article-title: Complexity results for flow-shop and open-shop scheduling problems with transportation delays publication-title: Annals of Operations Research doi: 10.1023/B:ANOR.0000030683.64615.c8 – year: 2018 ident: 10.1016/j.cie.2019.07.041_b0165 article-title: Behavior of crossover operators in NSGA-III for large-scale optimization problems publication-title: Information Sciences – volume: 89 start-page: 172 year: 1996 ident: 10.1016/j.cie.2019.07.041_b0045 article-title: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00235-5 – volume: 40 start-page: 235 year: 2014 ident: 10.1016/j.cie.2019.07.041_b0050 article-title: A quantum bio-parasitic genetic algorithm for solving a hybrid scheduling problem of flow shop and two-stage transportation publication-title: Journal of East China University of Science & Technology – volume: 23 start-page: 10 year: 1991 ident: 10.1016/j.cie.2019.07.041_b0055 article-title: Automated two-machine flowshop scheduling: A solvable case publication-title: IIE Transactions doi: 10.1080/07408179108963836 – volume: 27 start-page: 1144 year: 2014 ident: 10.1016/j.cie.2019.07.041_b0030 article-title: Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2013.874576 – year: 2003 ident: 10.1016/j.cie.2019.07.041_b0070 – volume: 38 start-page: 348 year: 2008 ident: 10.1016/j.cie.2019.07.041_b0170 article-title: Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-007-1104-y – start-page: 2633 year: 2013 ident: 10.1016/j.cie.2019.07.041_b0190 article-title: Simulation-based overhead-crane scheduling for a manufacturing plant – volume: 60 start-page: 425 year: 2017 ident: 10.1016/j.cie.2019.07.041_b0130 article-title: Comprehensive learning pigeon-inspired optimization with tabu list publication-title: SCIENCE CHINA Technological Sciences – volume: 103 start-page: 178 year: 2017 ident: 10.1016/j.cie.2019.07.041_b0060 article-title: Coordination of inbound and outbound transportation schedules with the production schedule publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.11.020 – volume: 205 start-page: 1 year: 2010 ident: 10.1016/j.cie.2019.07.041_b0125 article-title: The hybrid flow shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.09.024 – volume: 24 start-page: 136 year: 1981 ident: 10.1016/j.cie.2019.07.041_b0085 article-title: On equivalent-job for job-block in 2timesn sequencing problem with transportation-times publication-title: Journal of the Operations Research Society of Japan doi: 10.15807/jorsj.24.136 – volume: 30 start-page: 652 year: 2017 ident: 10.1016/j.cie.2019.07.041_b0195 article-title: Effective iterated greedy algorithm for flow-shop scheduling problems with time lags publication-title: Chinese Journal of Mechanical Engineering doi: 10.1007/s10033-017-0108-2 – volume: 4 start-page: 3 year: 2001 ident: 10.1016/j.cie.2019.07.041_b0020 article-title: Machine scheduling with transportation considerations publication-title: Journal of Scheduling doi: 10.1002/1099-1425(200101/02)4:1<3::AID-JOS57>3.0.CO;2-D – volume: 34 start-page: 1 year: 2000 ident: 10.1016/j.cie.2019.07.041_b0015 article-title: An exact method for solving the multi-processor flow-shop publication-title: RAIRO - Operations Research doi: 10.1051/ro:2000103 – year: 2003 ident: 10.1016/j.cie.2019.07.041_b0025 – volume: 37 start-page: 587 year: 1991 ident: 10.1016/j.cie.2019.07.041_b0090 article-title: A crane scheduling problem in a computer-integrated manufacturing environment publication-title: Management Science doi: 10.1287/mnsc.37.5.587 – volume: 161 start-page: 32 year: 2005 ident: 10.1016/j.cie.2019.07.041_b0135 article-title: Complexity of flow shop scheduling problems with transportation constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.03.002 – volume: 35 start-page: 1 year: 1997 ident: 10.1016/j.cie.2019.07.041_b0140 article-title: Scheduling a two-machine flowshop with travel times to minimize maximum lateness publication-title: International Journal of Production Research doi: 10.1080/002075497195948 – volume: 65 start-page: 180 year: 2014 ident: 10.1016/j.cie.2019.07.041_b0145 article-title: A joint production and transportation planning problem with heterogeneous vehicles publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2012.184 – volume: 37 start-page: 1439 year: 2010 ident: 10.1016/j.cie.2019.07.041_b0100 article-title: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.11.001 – volume: 40 start-page: 319 year: 2016 ident: 10.1016/j.cie.2019.07.041_b0185 article-title: Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2015.11.008 – volume: 65 start-page: 574 year: 2011 ident: 10.1016/j.cie.2019.07.041_b0160 article-title: Hybrid flowshop scheduling with finite transportation capacity publication-title: Applied Mechanics & Materials doi: 10.4028/www.scientific.net/AMM.65.574 – volume: 177 start-page: 2033 year: 2007 ident: 10.1016/j.cie.2019.07.041_b0115 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.009 |
| SSID | ssj0004591 |
| Score | 2.5112395 |
| Snippet | •Developed dynamic waiting time calculation approach (DWC).•Developed machine selection heuristics.•Proposed memetic framework that integrate iterated greedy... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 105984 |
| SubjectTerms | Dynamic waiting times Flexible flow-shop scheduling Integrated scheduling Iterated greedy algorithm Makespan |
| Title | Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times |
| URI | https://dx.doi.org/10.1016/j.cie.2019.07.041 |
| Volume | 139 |
| WOSCitedRecordID | wos000509784000057&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: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZWLQc4QCkgSinygRNVkNd5OD5WqKhFouJQxMIlchybzWqbrLq7be_88Y5fSVooogcuUWQljpX5NJ4Zz3yD0NtECZEzIaNKp0mUMCojTkQZZXGcclLFJkxom02wk5N8MuFfRqNfoRbmYs6aJr-64ov_KmoYA2Gb0tl7iLubFAbgHoQOVxA7XP9J8J_VmbIsrPOfLXj-0zObSQjftKEDbQgwTbWUnreX0XLaLvbBv4X9xpel2_YyvuStct3qTRsJR4C-fylq11iiKxwJJAe-OcTSQqnu-4Gonu-wz_2p3UH_WjSzugPnj6loHTb7R7-7AHnbj3xbm5FJDesdBiwoGQQsQqEWiYzhd0MJO0ojr0aN0ec6x_2m4V2wYfYeNJ9JzOOWetVxZ91k0761y3W5hyGtbVbAFIWZoiCsIIb8YJOylINq3Dw4Ppx8GpDOu8aLYd3hcNymCd5ax5_Nm4HJcrqFHntfAx84jDxFI9Vsoyfe78Beqy-30aMBKeUzVHsA4Q5AGACEPYBwABDuAIR7AOEAIGwAhD2AcAcg7AGELYCeo68fD08_HEW-IUckKWerSMpSKPAxlcw0TUpR5lTkseTVWJeKKPh5FVOUCF6WMRVapWmV6YxUCpxmZjaPF2ijaRv1EuGxjonMqrFSlCWp0mClg7HIU6oyQ19U7iAS_iPIyWWlmKYp8-JO-e2gd90rC0fV8reHkyCcwtuazoYsAGh3v_bqPt_YRQ97_L9GG6vztdpDD-TFql6ev_EouwZ786PO |
| 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=Memetic+algorithm+for+solving+flexible+flow-shop+scheduling+problems+with+dynamic+transport+waiting+times&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Lei%2C+Chuanjin&rft.au=Zhao%2C+Ning&rft.au=Ye%2C+Song&rft.au=Wu%2C+Xiuli&rft.date=2020-01-01&rft.issn=0360-8352&rft.volume=139&rft.spage=105984&rft_id=info:doi/10.1016%2Fj.cie.2019.07.041&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cie_2019_07_041 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |