Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates
We consider the scheduling problem in hybrid flow shops that consist of two stages in series, each of which has multiple identical parallel machines. Each job has reentrant flow, i.e., the job visits each production stage several times. The problem is to determine the allocation of jobs to machines...
Gespeichert in:
| Veröffentlicht in: | International journal of advanced manufacturing technology Jg. 42; H. 9-10; S. 963 - 973 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
London
Springer-Verlag
01.06.2009
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 0268-3768, 1433-3015 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider the scheduling problem in hybrid flow shops that consist of two stages in series, each of which has multiple identical parallel machines. Each job has reentrant flow, i.e., the job visits each production stage several times. The problem is to determine the allocation of jobs to machines as well as the sequence of the jobs assigned to each machine for the objective of minimizing makespan subject to the maximum allowable due dates in the form of a constraint set with a certain allowance. To solve the problem, two types of algorithms are suggested: (a) a branch and bound algorithm that gives optimal semi-permutation schedules; and (b) heuristic algorithms that give non-permutation schedules. To show their performances, computational experiments were done on a number of test problems and the results are reported. In particular, one of the heuristics is competitive to the branch and bound algorithm with respect to the solution quality while requiring much shorter computation times. |
|---|---|
| AbstractList | We consider the scheduling problem in hybrid flow shops that consist of two stages in series, each of which has multiple identical parallel machines. Each job has reentrant flow, i.e., the job visits each production stage several times. The problem is to determine the allocation of jobs to machines as well as the sequence of the jobs assigned to each machine for the objective of minimizing makespan subject to the maximum allowable due dates in the form of a constraint set with a certain allowance. To solve the problem, two types of algorithms are suggested: (a) a branch and bound algorithm that gives optimal semi-permutation schedules; and (b) heuristic algorithms that give non-permutation schedules. To show their performances, computational experiments were done on a number of test problems and the results are reported. In particular, one of the heuristics is competitive to the branch and bound algorithm with respect to the solution quality while requiring much shorter computation times. |
| Author | Lee, Dong-Ho Yun, Chang Yeon Chae, Kevin B. Choi, Hyun-Seon Yoon, Junggee Kim, Hyung-Won |
| Author_xml | – sequence: 1 givenname: Hyun-Seon surname: Choi fullname: Choi, Hyun-Seon organization: Department of Industrial Engineering, Hanyang University – sequence: 2 givenname: Hyung-Won surname: Kim fullname: Kim, Hyung-Won organization: Department of Industrial Engineering, Hanyang University – sequence: 3 givenname: Dong-Ho surname: Lee fullname: Lee, Dong-Ho email: leman@hanyang.ac.kr organization: Department of Industrial Engineering, Hanyang University – sequence: 4 givenname: Junggee surname: Yoon fullname: Yoon, Junggee organization: SCM Consulting Team, Samsung SDS – sequence: 5 givenname: Chang Yeon surname: Yun fullname: Yun, Chang Yeon organization: SCM Consulting Team, Samsung SDS – sequence: 6 givenname: Kevin B. surname: Chae fullname: Chae, Kevin B. organization: SCM Consulting Team, Samsung SDS |
| BookMark | eNp9kF1LHDEUhkNRcFf9Ad4Fep2aj5lM7F1ZWi0seKFeh2zmZCd2JtkmGbb6682yBaFQLw6Bw_u8JzxLdBJiAISuGP3CKO2uM6Wso4RSRZhsJWk_oQVrhCCCsvYELSiXiohOqjO0zPm5piWTaoFeH-wA_Tz6sMVm3MbkyzBl7GLCZR9JLmYLOAGEkkwoeHjZJN9jN8Y9zkPc5a948sFP_vVQMJlfkHcm4Dn0UAsGqKs_fpqn2l0RsxkB93MdUyBfoFNnxgyXf99z9PTj--Pqjqzvb3-uvq2JFYoX0t7QBqhplHQGurbvnJWyZc0NM5YLw0E1IData6xi1jJnbSOkYjW46WnXO3GOPh97dyn-niEX_RznFOpJzbnkDadMyJpix5RNMecETu-Sn0x60Yzqg2J9VKyrYn1QrNvKdP8w1hdTfDzY8uOHJD-SuV4JW0jvf_o_9AZzoZSd |
| CitedBy_id | crossref_primary_10_1177_09544054231182174 crossref_primary_10_1057_jors_2013_70 crossref_primary_10_4018_jal_2012100102 crossref_primary_10_1080_00207543_2017_1304661 crossref_primary_10_1007_s10845_015_1078_9 crossref_primary_10_1007_s00170_013_5187_3 crossref_primary_10_1016_j_cie_2017_02_010 crossref_primary_10_1080_00207543_2010_543171 crossref_primary_10_1007_s00170_013_5534_4 crossref_primary_10_1007_s12351_023_00770_0 crossref_primary_10_1016_j_cor_2012_10_015 crossref_primary_10_1080_00207543_2012_756151 crossref_primary_10_1155_2019_2573873 crossref_primary_10_1016_j_asoc_2015_11_034 crossref_primary_10_1016_j_eswa_2010_08_139 crossref_primary_10_3934_jimo_2025121 crossref_primary_10_1016_j_cie_2025_111062 crossref_primary_10_1016_S1003_6326_24_66472_1 crossref_primary_10_1080_00207543_2014_910627 crossref_primary_10_1109_TSMC_2023_3305089 crossref_primary_10_1007_s00170_011_3204_y crossref_primary_10_1016_j_asoc_2014_07_002 crossref_primary_10_1080_00207543_2015_1120900 crossref_primary_10_1016_j_cor_2023_106183 |
| Cites_doi | 10.1016/0377-2217(91)90148-O 10.1016/S0925-5273(99)00051-1 10.1287/opre.45.5.702 10.1080/00207540500050071 10.1080/0020754041233127044 10.1016/S0377-2217(00)00142-9 10.1080/002075498192599 10.1016/0167-6377(94)90026-4 10.1007/s00170-005-0017-x 10.1080/07408179408966627 10.1109/66.4384 10.1016/S0377-2217(03)00434-X 10.1016/S0360-8352(99)00023-6 10.1287/mnsc.11.3.460 10.1057/palgrave.jors.2601556 10.1080/07408179208964233 10.1016/S0377-2217(98)00060-5 10.1016/0167-6377(88)90033-8 10.1016/0305-0483(83)90088-9 10.1057/jors.1995.28 10.1023/A:1018927407164 10.1080/00207540310001602892 10.1287/mnsc.16.10.B630 10.1016/S0360-8352(97)00250-7 10.1016/S0278-6125(98)80024-1 10.1007/s00170-006-0818-6 10.1080/00207549608905076 10.1016/S0305-0548(00)00099-X 10.1016/j.cor.2003.10.004 10.1007/s00170-007-0977-0 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag London Limited 2008 The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2008). All Rights Reserved. |
| Copyright_xml | – notice: Springer-Verlag London Limited 2008 – notice: The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2008). All Rights Reserved. |
| DBID | AAYXX CITATION 8FE 8FG ABJCF AFKRA BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1007/s00170-008-1656-5 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland ProQuest Central Technology Collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | CrossRef Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic ProQuest Central (New) Engineering Collection ProQuest One Academic (New) |
| DatabaseTitleList | Engineering Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1433-3015 |
| EndPage | 973 |
| ExternalDocumentID | 10_1007_s00170_008_1656_5 |
| GroupedDBID | -5B -5G -BR -EM -XW -XX -Y2 -~C .86 .VR 06D 0R~ 0VY 123 1N0 1SB 203 28- 29J 29~ 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X 9M8 AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP 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 ARCEE ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EAS EBLON EBS EIOEI EJD EMK EPL ESBYG ESX 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~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW L6V LAS LLZTM M4Y M7S MA- ML~ N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9P PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCV SDH SDM SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z85 Z86 Z88 Z8M Z8N Z8P Z8Q Z8R Z8S Z8T Z8U Z8V Z8W Z8Z Z92 ZMTXR ZY4 _50 ~8M ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB DWQXO PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c382t-5904e0a486fae75d7fc6651491ac23a2e84e3b5f4c81cc1fcc436815d7bd07df3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 30 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000266488000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0268-3768 |
| IngestDate | Tue Nov 04 22:19:02 EST 2025 Sat Nov 29 05:50:45 EST 2025 Tue Nov 18 22:43:11 EST 2025 Fri Feb 21 02:30:52 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9-10 |
| Keywords | Reentrant hybrid flow shops Scheduling Branch and bound Heuristics |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c382t-5904e0a486fae75d7fc6651491ac23a2e84e3b5f4c81cc1fcc436815d7bd07df3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2262420136 |
| PQPubID | 2044010 |
| PageCount | 11 |
| ParticipantIDs | proquest_journals_2262420136 crossref_primary_10_1007_s00170_008_1656_5 crossref_citationtrail_10_1007_s00170_008_1656_5 springer_journals_10_1007_s00170_008_1656_5 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-06-01 |
| PublicationDateYYYYMMDD | 2009-06-01 |
| PublicationDate_xml | – month: 06 year: 2009 text: 2009-06-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: Heidelberg |
| PublicationTitle | International journal of advanced manufacturing technology |
| PublicationTitleAbbrev | Int J Adv Manuf Technol |
| PublicationYear | 2009 |
| Publisher | Springer-Verlag Springer Nature B.V |
| Publisher_xml | – name: Springer-Verlag – name: Springer Nature B.V |
| References | McNaughton (CR31) 1965; 11 CR15 Nawaz, Enscore, Ham (CR34) 1983; 11 Chen (CR23) 2006; 29 Kim, Lee, Kim, Roh (CR29) 1998; 17 Azizoglu, Cakmak, Kondakci (CR12) 2001; 132 Park, Kim, Jun (CR24) 2002; 29 Lee, Park (CR7) 1999; 25 Choi, Lee (CR14) 2007; 33 Wein (CR27) 1988; 1 Chen (CR6) 1995; 46 Pan, Chen (CR30) 2005; 32 Lee, Kim, Choi (CR13) 2004; 42 Mourisli, Pochet (CR10) 2000; 64 Linn, Zhang (CR1) 1999; 37 Drobouchevitch, Strusevich (CR21) 1999; 86 Gupta, Tunc (CR4) 1991; 29 Bertel, Billaut (CR17) 2004; 159 Hwang, Sun (CR20) 1997; 33 Gupta, Tunc (CR11) 1998; 36 Tsubone, Ohba, Uetake (CR3) 1996; 34 Lee, Vairaktarakis (CR5) 1994; 16 Brah, Hunsucker (CR9) 1991; 51 Guo, Wong, Leung, Fan, Chan (CR16) 2008; 36 Uzsoy, Lee, Martin-Vega (CR26) 1994; 26 Glassey, Resende (CR28) 1988; 7 Uzsoy, Lee, Martin-Vega (CR25) 1992; 24 Baker (CR33) 1974 Riane, Artiba, Elmaghraby (CR8) 1998; 109 Choi, Kim, Lee (CR18) 2005; 43 Pan, Chen (CR22) 2003; 54 Lee, Kim (CR2) 2004; 42 Campbell, Dudek, Smith (CR32) 1970; 16 Wang, Sethi, Van de Velde (CR19) 1997; 45 YS Park (1656_CR24) 2002; 29 J-S Lee (1656_CR7) 1999; 25 R McNaughton (1656_CR31) 1965; 11 B Chen (1656_CR6) 1995; 46 HG Campbell (1656_CR32) 1970; 16 S Bertel (1656_CR17) 2004; 159 Y-D Kim (1656_CR29) 1998; 17 ZX Guo (1656_CR16) 2008; 36 R Uzsoy (1656_CR25) 1992; 24 F Riane (1656_CR8) 1998; 109 KR Baker (1656_CR33) 1974 R Uzsoy (1656_CR26) 1994; 26 CR Glassey (1656_CR28) 1988; 7 R Linn (1656_CR1) 1999; 37 SA Brah (1656_CR9) 1991; 51 G-C Lee (1656_CR13) 2004; 42 S-W Choi (1656_CR18) 2005; 43 MY Wang (1656_CR19) 1997; 45 LM Wein (1656_CR27) 1988; 1 IG Drobouchevitch (1656_CR21) 1999; 86 G-C Lee (1656_CR2) 2004; 42 JND Gupta (1656_CR4) 1991; 29 H Hwang (1656_CR20) 1997; 33 JCH Pan (1656_CR22) 2003; 54 H Tsubone (1656_CR3) 1996; 34 JS Chen (1656_CR23) 2006; 29 1656_CR15 JCH Pan (1656_CR30) 2005; 32 CY Lee (1656_CR5) 1994; 16 M Nawaz (1656_CR34) 1983; 11 M Azizoglu (1656_CR12) 2001; 132 O Mourisli (1656_CR10) 2000; 64 JND Gupta (1656_CR11) 1998; 36 H-S Choi (1656_CR14) 2007; 33 |
| References_xml | – volume: 51 start-page: 88 year: 1991 end-page: 99 ident: CR9 article-title: Branch and bound algorithm for the flow shop with multiple processors publication-title: Eur J Oper Res doi: 10.1016/0377-2217(91)90148-O – volume: 64 start-page: 113 year: 2000 end-page: 125 ident: CR10 article-title: A branch-and-bound algorithm for the hybrid flow shop publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(99)00051-1 – volume: 45 start-page: 702 year: 1997 end-page: 712 ident: CR19 article-title: Minimizing makespan in a class of reentrant shops publication-title: Oper Res doi: 10.1287/opre.45.5.702 – volume: 33 start-page: 213 year: 2007 end-page: 220 ident: CR14 article-title: A branch and bound algorithm for two-stage hybrid flow shops: minimizing the number of tardy jobs publication-title: J Korean Inst Ind Engineers – volume: 43 start-page: 2149 year: 2005 end-page: 2167 ident: CR18 article-title: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop publication-title: Int J Prod Res doi: 10.1080/00207540500050071 – volume: 42 start-page: 4731 year: 2004 end-page: 4743 ident: CR2 article-title: A branch-and-bound algorithm for a two-stage hybrid flow shop scheduling problem minimizing total tardiness publication-title: Int J Prod Res doi: 10.1080/0020754041233127044 – volume: 132 start-page: 528 year: 2001 end-page: 538 ident: CR12 article-title: A flexible flow shop problem with total flow time minimization publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(00)00142-9 – volume: 36 start-page: 2397 year: 1998 end-page: 2417 ident: CR11 article-title: Minimizing tardy jobs in a two-stage hybrid flowshop publication-title: Int J Prod Res doi: 10.1080/002075498192599 – volume: 16 start-page: 149 year: 1994 end-page: 158 ident: CR5 article-title: Minimizing makespan in hybrid flow shops publication-title: Oper Res Lett doi: 10.1016/0167-6377(94)90026-4 – volume: 29 start-page: 1186 year: 2006 end-page: 1193 ident: CR23 article-title: A branch and bound procedure for the reentrant permutation flow-shop scheduling problem publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-005-0017-x – volume: 26 start-page: 44 year: 1994 end-page: 55 ident: CR26 article-title: A review of production planning and scheduling models in the semiconductor industry part II: shop-floor control publication-title: IIE Trans doi: 10.1080/07408179408966627 – volume: 1 start-page: 115 year: 1988 end-page: 130 ident: CR27 article-title: Scheduling semiconductor wafer fabrication publication-title: IEEE Trans Semicond Manuf doi: 10.1109/66.4384 – volume: 159 start-page: 651 year: 2004 end-page: 662 ident: CR17 article-title: A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00434-X – volume: 37 start-page: 57 year: 1999 end-page: 61 ident: CR1 article-title: Hybrid flow shop scheduling publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(99)00023-6 – volume: 11 start-page: 460 year: 1965 end-page: 475 ident: CR31 article-title: Scheduling with deadlines and loss functions on parallel machines publication-title: Manage Sci doi: 10.1287/mnsc.11.3.460 – volume: 54 start-page: 642 year: 2003 end-page: 653 ident: CR22 article-title: Minimizing makespan in re-entrant permutation flow-shops publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601556 – volume: 24 start-page: 47 year: 1992 end-page: 60 ident: CR25 article-title: A review of production planning and scheduling models in the semiconductor industry part I: system characteristics, performance evaluation and production planning publication-title: IIE Trans doi: 10.1080/07408179208964233 – volume: 32 start-page: 1197 year: 2005 end-page: 1212 ident: CR30 article-title: Mixed binary integer programming formulations for the reentrant job shop scheduling problem publication-title: Comput Oper Res – volume: 109 start-page: 321 year: 1998 end-page: 329 ident: CR8 article-title: A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(98)00060-5 – volume: 7 start-page: 213 year: 1988 end-page: 217 ident: CR28 article-title: A scheduling rule for job release in semiconductor fabrication publication-title: Oper Res Lett doi: 10.1016/0167-6377(88)90033-8 – volume: 25 start-page: 254 year: 1999 end-page: 265 ident: CR7 article-title: Scheduling heuristics for a two-stage hybrid flowshop with nonidentical parallel machines publication-title: J Korean Inst Ind Engineers – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: CR34 article-title: A heuristic algorithm for the machine, job flow shop sequence problem publication-title: OMEGA Int J Manage Sci doi: 10.1016/0305-0483(83)90088-9 – volume: 46 start-page: 231 year: 1995 end-page: 244 ident: CR6 article-title: Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage publication-title: J Oper Res Soc doi: 10.1057/jors.1995.28 – ident: CR15 – volume: 86 start-page: 417 year: 1999 end-page: 439 ident: CR21 article-title: A heuristic algorithm for two-machine re-entrant shop scheduling publication-title: Ann Oper Res doi: 10.1023/A:1018927407164 – year: 1974 ident: CR33 publication-title: Introduction to sequencing and scheduling – volume: 42 start-page: 165 year: 2004 end-page: 181 ident: CR13 article-title: Bottleneck-focused scheduling for a hybrid flow shop publication-title: Int J Prod Res doi: 10.1080/00207540310001602892 – volume: 29 start-page: 1480 year: 1991 end-page: 1502 ident: CR4 article-title: Scheduling for a two-stage hybrid flowshop with parallel machines at the second stage publication-title: Int J Prod Res – volume: 16 start-page: 630 year: 1970 end-page: 637 ident: CR32 article-title: A heuristic algorithm for the job machine sequencing problem publication-title: Manage Sci doi: 10.1287/mnsc.16.10.B630 – volume: 33 start-page: 773 year: 1997 end-page: 776 ident: CR20 article-title: Production sequencing problem with reentrant work flows and sequence dependent setup times publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(97)00250-7 – volume: 17 start-page: 107 year: 1998 end-page: 117 ident: CR29 article-title: A simulation study on lot release control, dispatching and batch scheduling in semiconductor wafer fabrication facilities publication-title: J Manuf Syst doi: 10.1016/S0278-6125(98)80024-1 – volume: 36 start-page: 156 year: 2008 end-page: 168 ident: CR16 article-title: A genetic-algorithm-based optimization model for scheduling flexible assembly lines publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-006-0818-6 – volume: 34 start-page: 3037 year: 1996 end-page: 3053 ident: CR3 article-title: The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop publication-title: Int J Prod Res doi: 10.1080/00207549608905076 – volume: 29 start-page: 1009 year: 2002 end-page: 1024 ident: CR24 article-title: Mean value analysis of re-entrant line with batch machines and multi-class jobs publication-title: Comput Oper Res doi: 10.1016/S0305-0548(00)00099-X – volume: 159 start-page: 651 year: 2004 ident: 1656_CR17 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00434-X – volume: 32 start-page: 1197 year: 2005 ident: 1656_CR30 publication-title: Comput Oper Res doi: 10.1016/j.cor.2003.10.004 – volume: 1 start-page: 115 year: 1988 ident: 1656_CR27 publication-title: IEEE Trans Semicond Manuf doi: 10.1109/66.4384 – volume: 45 start-page: 702 year: 1997 ident: 1656_CR19 publication-title: Oper Res doi: 10.1287/opre.45.5.702 – volume: 46 start-page: 231 year: 1995 ident: 1656_CR6 publication-title: J Oper Res Soc doi: 10.1057/jors.1995.28 – volume: 109 start-page: 321 year: 1998 ident: 1656_CR8 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(98)00060-5 – volume: 29 start-page: 1009 year: 2002 ident: 1656_CR24 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(00)00099-X – volume: 16 start-page: 149 year: 1994 ident: 1656_CR5 publication-title: Oper Res Lett doi: 10.1016/0167-6377(94)90026-4 – volume-title: Introduction to sequencing and scheduling year: 1974 ident: 1656_CR33 – volume: 11 start-page: 460 year: 1965 ident: 1656_CR31 publication-title: Manage Sci doi: 10.1287/mnsc.11.3.460 – volume: 16 start-page: 630 year: 1970 ident: 1656_CR32 publication-title: Manage Sci doi: 10.1287/mnsc.16.10.B630 – volume: 51 start-page: 88 year: 1991 ident: 1656_CR9 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(91)90148-O – volume: 42 start-page: 4731 year: 2004 ident: 1656_CR2 publication-title: Int J Prod Res doi: 10.1080/0020754041233127044 – volume: 43 start-page: 2149 year: 2005 ident: 1656_CR18 publication-title: Int J Prod Res doi: 10.1080/00207540500050071 – volume: 7 start-page: 213 year: 1988 ident: 1656_CR28 publication-title: Oper Res Lett doi: 10.1016/0167-6377(88)90033-8 – volume: 42 start-page: 165 year: 2004 ident: 1656_CR13 publication-title: Int J Prod Res doi: 10.1080/00207540310001602892 – volume: 86 start-page: 417 year: 1999 ident: 1656_CR21 publication-title: Ann Oper Res doi: 10.1023/A:1018927407164 – volume: 17 start-page: 107 year: 1998 ident: 1656_CR29 publication-title: J Manuf Syst doi: 10.1016/S0278-6125(98)80024-1 – volume: 132 start-page: 528 year: 2001 ident: 1656_CR12 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(00)00142-9 – volume: 36 start-page: 2397 year: 1998 ident: 1656_CR11 publication-title: Int J Prod Res doi: 10.1080/002075498192599 – volume: 29 start-page: 1186 year: 2006 ident: 1656_CR23 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-005-0017-x – volume: 64 start-page: 113 year: 2000 ident: 1656_CR10 publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(99)00051-1 – volume: 25 start-page: 254 year: 1999 ident: 1656_CR7 publication-title: J Korean Inst Ind Engineers – ident: 1656_CR15 doi: 10.1007/s00170-007-0977-0 – volume: 33 start-page: 773 year: 1997 ident: 1656_CR20 publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(97)00250-7 – volume: 33 start-page: 213 year: 2007 ident: 1656_CR14 publication-title: J Korean Inst Ind Engineers – volume: 29 start-page: 1480 year: 1991 ident: 1656_CR4 publication-title: Int J Prod Res – volume: 34 start-page: 3037 year: 1996 ident: 1656_CR3 publication-title: Int J Prod Res doi: 10.1080/00207549608905076 – volume: 36 start-page: 156 year: 2008 ident: 1656_CR16 publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-006-0818-6 – volume: 26 start-page: 44 year: 1994 ident: 1656_CR26 publication-title: IIE Trans doi: 10.1080/07408179408966627 – volume: 11 start-page: 91 year: 1983 ident: 1656_CR34 publication-title: OMEGA Int J Manage Sci doi: 10.1016/0305-0483(83)90088-9 – volume: 54 start-page: 642 year: 2003 ident: 1656_CR22 publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601556 – volume: 37 start-page: 57 year: 1999 ident: 1656_CR1 publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(99)00023-6 – volume: 24 start-page: 47 year: 1992 ident: 1656_CR25 publication-title: IIE Trans doi: 10.1080/07408179208964233 |
| SSID | ssj0016168 ssib034539549 ssib019759004 ssib029851711 |
| Score | 2.0993588 |
| Snippet | We consider the scheduling problem in hybrid flow shops that consist of two stages in series, each of which has multiple identical parallel machines. Each job... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 963 |
| SubjectTerms | Algorithms CAE) and Design Computer-Aided Engineering (CAD Engineering Industrial and Production Engineering Machine shops Mechanical Engineering Media Management Original Article Permutations Production scheduling Schedules Scheduling |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nb9QwELWgcKAHvlEXCvKBE8gidhLHOVUVouJUIRWk3iLHHu-u2GxKk-2W_npmvMkuINELh1wSZ5RoxvaTZ-Y9xt5qqL1yaS2CtLnIDJSiVkELpyTEOkDtbBSbKE5Pzfl5-WU4cOuGsspxTYwLtW8dnZF_QJiAuwkxjB1d_BCkGkXZ1UFC4y67RywJKpbunY3xJMuCNDG38aZKEqLfxXOa5ekmyzVkHbSMrXP4gYYmnhmzoEkkHY0SLUSGihBI5H_uYztw-lc-NW5TJ4_-9wcfs4cDQOXHm4h6wu7A8inb_4228Bm7OUNPeyphn3K7mKKRftZ0HOEv79etQLw5BU71PD1uhD2f_aSuMB4W7Zp3sxa_jxOhSTO_IQON_Q64qi05dbOhgRngret5s2o41QSsqbWL-xVehIqfs28nn75-_CwGDQfhUqN6gQ7IILGZ0cFCkfsiOK0RpJXSOpVaBSaDtM5D5ox0TgbniBJf4sDaJ4UP6Qu2t2yXcMB44kEnTgJoC1leZqW3SvrE2DSAktZMWDJ6pHIDwTnpbCyqLTVzdGJFwpvkxCqfsHfbVy427B63DT4cHVcNE72rdl6bsPej63eP_2ns5e3GXrEHm7QVHfccsr3-cgWv2X131c-7yzcxyn8BGzX_nQ priority: 102 providerName: ProQuest |
| Title | Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates |
| URI | https://link.springer.com/article/10.1007/s00170-008-1656-5 https://www.proquest.com/docview/2262420136 |
| Volume | 42 |
| WOSCitedRecordID | wos000266488000011&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: Engineering Database customDbUrl: eissn: 1433-3015 dateEnd: 20221231 omitProxy: false ssIdentifier: ssj0016168 issn: 0268-3768 databaseCode: M7S dateStart: 19970201 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-3015 dateEnd: 20221231 omitProxy: false ssIdentifier: ssj0016168 issn: 0268-3768 databaseCode: BENPR dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1433-3015 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016168 issn: 0268-3768 databaseCode: RSV dateStart: 19970101 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/eLvHCXMwnV3Pb9MwFLZg48AO4-dEt1H5wAlkKXYSxzkC2sSpmlZAu0WO_dxWNA1q0hX21-PnJu1AMGkcckkcx_F79vvk9973CHkjobTCxCVzXKcsUZCzUjjJjOAQ4gCl0aHYRDYaqaur_KLL4276aPfeJRl26m2yW6B6YYGO1IMQlj4k-97aKVyNl-OvvRLxPMNCmFslEzlWn98pcZyk8ca11bkaJA_5cn5UCleb6l2ff_vk78Zrh0j_cKIG23T-5L_-6ik57KAofb_RnWfkASyek4NbBIUvyM3Yy9RisPqE6vmkXs7aadVQD3Rpu66ZR5YToBi503qT19LpT8z_om5er2kzrf2gKFKXVLMb7KDS38DvXwuKeWu-gyn4Wz9m1aqi6P1fYxIXtSt_If59Sb6cn33--Il11RqYiZVomZ_1BCKdKOk0ZKnNnJHSw7GcayNiLUAlEJepS4zixnBnDJLfc9-wtFFmXXxE9hb1Al4RGlmQkeEAUkOS5kluteA2Ujp2ILhWAxL1YihMR2WOFTXmxZaEOUxrgSU2cVqLdEDebl_5vuHxuKvxaS_bolvSTeFxqoczSHE3IO96We4e_7Oz43u1PiGPN_4qPOc5JXvtcgWvySNz3c6a5ZDsfzgbXVwOMUJ1PAx6_wvPbfet |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQceCMWCvgAF5BF7LycA0IIqFq1rJBapN6CY092V-xuSpNlaX8UvxGPk-wCEr31wCGXPEaJ83k8ycx8H8CzBAsrTVjwUuiYRwozXsgy4UYK9HWAidFebCIdDtXRUfZpA372vTBUVtn7RO-obWXoH_krFya41YQYxt4cf-OkGkXZ1V5Co4XFHp4u3Sdb_Xr3vXu_z6Xc_nD4bod3qgLchEo2PM6CCAMdqaTUmMY2LU2SuLAhE9rIUEtUEYZFXEZGCWNEaQyRtAt3YmGD1Jahs3sJLkfk_X2p4EGPX5GlpMG5wrfMSPh-PX_CKA7brFqX5UiEb9VzA6Jooqs-6xp4klMvCUPkqy7k4vGf6-Y6GP4rf-uXxe2b_9uA3oIbXQDO3rYz5jZs4PwOXP-NlvEunB04JFsq0R8xPR25m27Gs5q58J41y4q7eHqEjOqVGrfQN2x8Sl1vrJxWS1aPKzcejAhbZpMzMjDTX9F57Tmjbj1nYIxu14_JbDFjVPOwpNY1Zhduo6j_Hny-kIe_D5vzao4PgAUWk8AIxERjFGdRZrUUNlA6LFEKrQYQ9AjITUfgTjoi03xFPe1Bk5OwKIEmjwfwYnXJcctect7JWz1Q8s6R1fkaJQN42UNtffifxh6eb-wpXN05_Lif7-8O9x7BtTZFR7-2tmCzOVngY7hivjeT-uSJn2EMvlw0An8BpJxdcg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nj9MwELVgQQgOfCMKC_jACWRt7DiOc0RABQJVKy2gvUWOPW4rmmTVpBT21-PJRwsIkBCHXBLHcTLj-CUz8x4hTxUUTti4YJ6bhEkNGSuEV8wKDl0eoLKmE5tIZzN9epodDzqnzZjtPoYk-5oGZGmq2qMz5492hW8d7QvrqEkDIGHJRXJJomYQfq6ffBodimcpimLuHE5kqES_d-hYJnEf5hrCDop3tXNhhBpnnh7DoL-75M8L2R6d_hJQ7dap6Y3_vsOb5PoAUemL3qdukQtQ3SbXfiAuvEPOT4KtHSaxz6lZzev1sl2UDQ0AmLbbmgXEOQeKGT1tWApbuviGdWHUr-otbRZ1GCBFSpNyeY4dlOYzhPdaRbGeLXSwgLDr67LclBSzArZY3EXdJmyIi--Sj9PXH16-YYOKA7OxFi0LFpAQGamVN5AmLvVWqQDTMm6siI0ALSEuEi-t5tZyby2S4vPQsHBR6nx8jxxUdQX3CY0cqMhyAGVAJpnMnBHcRdrEHgQ3ekKi0SS5HSjOUWljle_ImbvHmqP0Jj7WPJmQZ7tTznp-j781PhztnA9TvckDfg0wB6nvJuT5aNf94T929uCfWj8hV45fTfP3b2fvHpKrfUgLfwUdkoN2vYFH5LL90i6b9eNuAnwHrdEA8g |
| 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=Scheduling+algorithms+for+two-stage+reentrant+hybrid+flow+shops%3A+minimizing+makespan+under+the+maximum+allowable+due+dates&rft.jtitle=International+journal+of+advanced+manufacturing+technology&rft.au=Choi%2C+Hyun-Seon&rft.au=Kim%2C+Hyung-Won&rft.au=Lee%2C+Dong-Ho&rft.au=Yoon%2C+Junggee&rft.date=2009-06-01&rft.pub=Springer-Verlag&rft.issn=0268-3768&rft.eissn=1433-3015&rft.volume=42&rft.issue=9-10&rft_id=info:doi/10.1007%2Fs00170-008-1656-5&rft.externalDocID=10_1007_s00170_008_1656_5 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0268-3768&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0268-3768&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0268-3768&client=summon |