A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly...
Saved in:
| Published in: | Operational research Vol. 20; no. 1; pp. 21 - 35 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.03.2020
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1109-2858, 1866-1505 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly generated instances, provide evidence that the proposed procedure performs consistently well. |
|---|---|
| AbstractList | We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly generated instances, provide evidence that the proposed procedure performs consistently well. |
| Author | Rakrouki, Mohamed Ali Chalghoumi, Sabrine Kooli, Anis Ladhari, Talel |
| Author_xml | – sequence: 1 givenname: Mohamed Ali surname: Rakrouki fullname: Rakrouki, Mohamed Ali organization: College of Computer Science & Engineering, Taibah University, Ecole Supérieure des Sciences Economiques et Commerciales de Tunis, Université de Tunis – sequence: 2 givenname: Anis surname: Kooli fullname: Kooli, Anis email: anis.kooli@gmail.com organization: Ecole Supérieure des Sciences Economiques et Commerciales de Tunis, Université de Tunis – sequence: 3 givenname: Sabrine surname: Chalghoumi fullname: Chalghoumi, Sabrine organization: Ecole Supérieure des Sciences Economiques et Commerciales de Tunis, Université de Tunis – sequence: 4 givenname: Talel surname: Ladhari fullname: Ladhari, Talel organization: Ecole Supérieure des Sciences Economiques et Commerciales de Tunis, Université de Tunis, College of Business Administration, Umm Al-Qura University, Business Analytics and Decision Making Lab (BADEM), Tunis Business School, Université de Tunis |
| BookMark | eNp9kE1LxDAURYOM4KjzA9wFXEfz0U7S5TD4BQNudB2SNJ12aJOapAz-ezNUEATN5t3FPXmPcwkWzjsLwA3BdwRjfh8JZSVBmHCEGRaIn4ElEes1IiUuFzkTXCEqSnEBVjEecH6MclGIJRg3UAflTIuUq5H2k6uh6vc-dKkdYOMDTK2F6ejRoEzbuZx9Uj00fhh7mzrvYOoGC5veH2PrRzgGr3s7wDjpgzUp12GwvVXRwlolG6_BeaP6aFff8wq8Pz68bZ_R7vXpZbvZIcM4S6iqiC6aosIFNVpTbqilhBbEsJo0WBQVxfVa66rGoqzWqimZ0tTwoqhZzqxmV-B2_jcf9DHZmOTBT8HllTLLYhURJaO5ReaWCT7GYBs5hm5Q4VMSLE9u5exWZrfy5FbyzPBfjOmSOqlIQXX9vySdyZi3uL0NPzf9DX0BCGeQAg |
| CitedBy_id | crossref_primary_10_1007_s11590_024_02099_9 crossref_primary_10_1007_s12351_020_00577_3 crossref_primary_10_1080_00207543_2023_2188646 crossref_primary_10_1080_02533839_2021_1933600 crossref_primary_10_1109_ACCESS_2020_3015737 crossref_primary_10_1016_j_eswa_2024_125175 crossref_primary_10_1080_02533839_2021_1919560 |
| Cites_doi | 10.1016/0167-6377(95)00023-D 10.1137/S0097539796305778 10.1287/opre.13.3.400 10.1287/opre.33.2.363 10.1016/j.jcss.2006.10.018 10.1016/S0925-5273(02)00234-7 10.1023/B:JOSH.0000046075.73409.7d 10.1016/0305-0483(83)90088-9 10.1016/0377-2217(95)00351-7 10.1016/S0167-6377(02)00215-8 10.1016/j.ijpe.2009.06.031 10.1016/j.cor.2014.06.013 10.1007/BF03500931 10.1080/05695558308974629 10.1016/S0377-2217(03)00415-6 10.1016/j.cor.2013.01.001 10.1007/s10951-006-8789-x 10.1016/S0377-2217(01)00374-5 10.1109/ICMSAO.2013.6552646 10.1007/3-540-45540-X_2 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag Berlin Heidelberg 2017 Operational Research is a copyright of Springer, (2017). All Rights Reserved. |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2017 – notice: Operational Research is a copyright of Springer, (2017). All Rights Reserved. |
| DBID | AAYXX CITATION 3V. 7TB 7WY 7WZ 7XB 87Z 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G HCIFZ K60 K6~ K8~ KR7 L.- L6V M0C M7S PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PTHSS Q9U |
| DOI | 10.1007/s12351-017-0308-7 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland AUTh Library subscriptions: ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) SciTech Premium Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection DELNET Management Collection Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Engineering Database ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) ABI/INFORM Complete (Alumni Edition) Engineering Collection Business Premium Collection Civil Engineering Abstracts ABI/INFORM Global Engineering Database ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest DELNET Management Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) Engineering Research Database ProQuest One Academic ProQuest Central (Alumni) Business Premium Collection (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | ABI/INFORM Global (Corporate) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1866-1505 |
| EndPage | 35 |
| ExternalDocumentID | 10_1007_s12351_017_0308_7 |
| GroupedDBID | -57 -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 29N 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 30V 3V. 4.4 406 408 40D 40E 5VS 67Z 6NX 7WY 875 8FE 8FG 8FL 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTV ABHQN ABJCF ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC 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 ARMRJ AXYYD AYQZM B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP DDRTE DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GROUPED_ABI_INFORM_COMPLETE H13 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HZ~ IKXTQ IWAJR IXD I~X I~Z J-C J0Z JBSCW JZLTJ K60 K6~ K8~ KOV L6V LLZTM M0C M4Y M7S MA- NPVJJ NQJWS NU0 O9- O93 O9G O9J P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PTHSS Q2X QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 YLTOR Z45 Z5O Z81 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFFHD AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7TB 7XB 8FD 8FK FR3 KR7 L.- PKEHL PQEST PQUKI Q9U |
| ID | FETCH-LOGICAL-c373t-991b4f49042cbb27c2e21241c3d1f084920d6bb9d08596af53ab2c744d3f533d3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000512993700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1109-2858 |
| IngestDate | Tue Nov 04 23:13:06 EST 2025 Sat Nov 29 05:50:48 EST 2025 Tue Nov 18 21:45:38 EST 2025 Fri Feb 21 02:34:54 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Branch-and-bound Flowshop Release dates Total completion time |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c373t-991b4f49042cbb27c2e21241c3d1f084920d6bb9d08596af53ab2c744d3f533d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2353918532 |
| PQPubID | 326268 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_2353918532 crossref_primary_10_1007_s12351_017_0308_7 crossref_citationtrail_10_1007_s12351_017_0308_7 springer_journals_10_1007_s12351_017_0308_7 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-03-01 |
| PublicationDateYYYYMMDD | 2020-03-01 |
| PublicationDate_xml | – month: 03 year: 2020 text: 2020-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationSubtitle | An International Journal |
| PublicationTitle | Operational research |
| PublicationTitleAbbrev | Oper Res Int J |
| PublicationYear | 2020 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V |
| References | Chung, Flynn, Kirca (CR5) 2002; 79 Rinnooy Kan (CR25) 1976 Della Croce, Ghirardi, Tadei (CR7) 2002; 139 Haouari, Kharbeche (CR11) 2013; 40 Della Croce, T’Kindt (CR8) 2003; 31 Bansal (CR3) 1977; 9 CR17 Nawaz, Enscore, Ham (CR21) 1983; 11 CR10 Hoogeveen, Van de Velde (CR12) 1995; 17 Hoogeveen, Van Norden, Van de Velde (CR13) 2006; 9 Baker (CR2) 1974 Ignall, Schrage (CR14) 1965; 13 Ladhari, Rakrouki (CR19) 2009; 122 Jouglet, Baptiste, Carlier, Leung (CR15) 2004 T’Kindt, Della Croce, Esswein (CR27) 2004; 7 Kooli, Serairi (CR18) 2014; 51 CR4 Pinedo (CR22) 2008 Kellerer, Tautenhahn, Woeginger (CR16) 1999; 28 French (CR9) 1982 Potts, Van Wassenhove (CR23) 1985; 33 Van de Velde (CR28) 1990; 26 CR24 Leonardi, Raz (CR20) 1997; 73 Szwarc (CR26) 1983; 15 Della Croce, Narayan, Tadei (CR6) 1996; 90 Akkan, Karabati (CR1) 2004; 159 H Kellerer (308_CR16) 1999; 28 308_CR24 CS Chung (308_CR5) 2002; 79 F Della Croce (308_CR8) 2003; 31 M Haouari (308_CR11) 2013; 40 T Ladhari (308_CR19) 2009; 122 M Pinedo (308_CR22) 2008 E Ignall (308_CR14) 1965; 13 KR Baker (308_CR2) 1974 CN Potts (308_CR23) 1985; 33 W Szwarc (308_CR26) 1983; 15 308_CR10 V T’Kindt (308_CR27) 2004; 7 308_CR4 A Kooli (308_CR18) 2014; 51 308_CR17 S Velde Van de (308_CR28) 1990; 26 A Jouglet (308_CR15) 2004 SP Bansal (308_CR3) 1977; 9 AHG Rinnooy Kan (308_CR25) 1976 M Nawaz (308_CR21) 1983; 11 C Akkan (308_CR1) 2004; 159 F Della Croce (308_CR7) 2002; 139 H Hoogeveen (308_CR13) 2006; 9 S Leonardi (308_CR20) 1997; 73 F Della Croce (308_CR6) 1996; 90 S French (308_CR9) 1982 JA Hoogeveen (308_CR12) 1995; 17 |
| References_xml | – volume: 17 start-page: 205 issue: 5 year: 1995 end-page: 208 ident: CR12 article-title: Minimizing total completion and maximum cost simultaneously is solvable in polynomial time publication-title: Oper Res Lett doi: 10.1016/0167-6377(95)00023-D – year: 1982 ident: CR9 publication-title: Sequencing and scheduling: an introduction to the mathematics of the job-shop – volume: 28 start-page: 1155 issue: 4 year: 1999 end-page: 1166 ident: CR16 article-title: Approximability and non approximability results for minimizing total flow time on a single machine publication-title: SIAM J Comput doi: 10.1137/S0097539796305778 – volume: 13 start-page: 400 issue: 3 year: 1965 end-page: 412 ident: CR14 article-title: Application of the branch-and-bound technique to some flowshop scheduling problems publication-title: Oper Res doi: 10.1287/opre.13.3.400 – ident: CR4 – volume: 33 start-page: 363 issue: 2 year: 1985 end-page: 377 ident: CR23 article-title: A branch-and-bound algorithm for the total weighted tardiness problem publication-title: Oper Res doi: 10.1287/opre.33.2.363 – ident: CR10 – volume: 73 start-page: 875 issue: 6 year: 1997 end-page: 891 ident: CR20 article-title: Approximating total flow time on parallel machines publication-title: J Comput Syst Sci doi: 10.1016/j.jcss.2006.10.018 – volume: 79 start-page: 185 issue: 3 year: 2002 end-page: 196 ident: CR5 article-title: A branch-and-bound algorithm to minimize the total flow time for m-machine permutation flowshop problems publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(02)00234-7 – year: 1974 ident: CR2 publication-title: Introduction to sequencing and scheduling – volume: 9 start-page: 306 issue: 3 year: 1977 end-page: 311 ident: CR3 article-title: Minimizing the sum of completion times of n jobs over m machines in a flow shop publication-title: Am Inst Ind Eng Trans – volume: 7 start-page: 429 issue: 6 year: 2004 end-page: 440 ident: CR27 article-title: Revisiting branch and bound search strategies for machine scheduling problems publication-title: J Sched doi: 10.1023/B:JOSH.0000046075.73409.7d – volume: 11 start-page: 91 issue: 1 year: 1983 end-page: 96 ident: CR21 article-title: A heuristic algorithm for the -machine, -job flow-shop sequencing problem publication-title: OMEGA doi: 10.1016/0305-0483(83)90088-9 – volume: 90 start-page: 227 issue: 2 year: 1996 end-page: 237 ident: CR6 article-title: The two-machine total completion time flowshop problem publication-title: Eur J Oper Res doi: 10.1016/0377-2217(95)00351-7 – volume: 31 start-page: 142 issue: 2 year: 2003 end-page: 148 ident: CR8 article-title: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem publication-title: Oper Res Lett doi: 10.1016/S0167-6377(02)00215-8 – year: 2004 ident: CR15 article-title: Branch-and-bound algorithms for total weighted tardiness publication-title: Handbook of scheduling: algorithms, models and performance analysis – volume: 122 start-page: 678 issue: 2 year: 2009 end-page: 691 ident: CR19 article-title: Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2009.06.031 – volume: 51 start-page: 323 year: 2014 end-page: 330 ident: CR18 article-title: A mixed integer programming approach for the single machine problem with unequal release dates publication-title: Comput Oper Res doi: 10.1016/j.cor.2014.06.013 – volume: 26 start-page: 257 issue: 1 year: 1990 end-page: 268 ident: CR28 article-title: Minimizing the sum of job completion times in the two-machine flowshop by Lagrangian relaxation publication-title: Ann Oper Res doi: 10.1007/BF03500931 – volume: 15 start-page: 172 issue: 2 year: 1983 end-page: 176 ident: CR26 article-title: The flow shop problem with mean completion time criterion publication-title: IIE Trans doi: 10.1080/05695558308974629 – ident: CR17 – year: 1976 ident: CR25 publication-title: Machine sequencing problem: classification, complexity and computation – volume: 159 start-page: 420 issue: 2 year: 2004 end-page: 429 ident: CR1 article-title: The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00415-6 – volume: 40 start-page: 1693 issue: 7 year: 2013 end-page: 1699 ident: CR11 article-title: An assignment-based lower bound for a class of two-machine flow shop problems publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.01.001 – volume: 9 start-page: 559 issue: 6 year: 2006 end-page: 568 ident: CR13 article-title: Lower bounds for minimizing total completion time in a two-machine flow shop publication-title: J Sched doi: 10.1007/s10951-006-8789-x – year: 2008 ident: CR22 publication-title: Scheduling: theory, algorithms, and systems – ident: CR24 – volume: 139 start-page: 293 issue: 2 year: 2002 end-page: 301 ident: CR7 article-title: An improved branch-and-bound algorithm for the two machine total completion time flowshop problem publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(01)00374-5 – volume: 7 start-page: 429 issue: 6 year: 2004 ident: 308_CR27 publication-title: J Sched doi: 10.1023/B:JOSH.0000046075.73409.7d – volume: 13 start-page: 400 issue: 3 year: 1965 ident: 308_CR14 publication-title: Oper Res doi: 10.1287/opre.13.3.400 – volume-title: Sequencing and scheduling: an introduction to the mathematics of the job-shop year: 1982 ident: 308_CR9 – volume-title: Handbook of scheduling: algorithms, models and performance analysis year: 2004 ident: 308_CR15 – volume: 15 start-page: 172 issue: 2 year: 1983 ident: 308_CR26 publication-title: IIE Trans doi: 10.1080/05695558308974629 – volume: 9 start-page: 559 issue: 6 year: 2006 ident: 308_CR13 publication-title: J Sched doi: 10.1007/s10951-006-8789-x – volume: 73 start-page: 875 issue: 6 year: 1997 ident: 308_CR20 publication-title: J Comput Syst Sci doi: 10.1016/j.jcss.2006.10.018 – volume: 9 start-page: 306 issue: 3 year: 1977 ident: 308_CR3 publication-title: Am Inst Ind Eng Trans – ident: 308_CR4 doi: 10.1109/ICMSAO.2013.6552646 – volume: 28 start-page: 1155 issue: 4 year: 1999 ident: 308_CR16 publication-title: SIAM J Comput doi: 10.1137/S0097539796305778 – volume: 122 start-page: 678 issue: 2 year: 2009 ident: 308_CR19 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2009.06.031 – volume-title: Introduction to sequencing and scheduling year: 1974 ident: 308_CR2 – volume: 79 start-page: 185 issue: 3 year: 2002 ident: 308_CR5 publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(02)00234-7 – volume: 90 start-page: 227 issue: 2 year: 1996 ident: 308_CR6 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(95)00351-7 – volume: 40 start-page: 1693 issue: 7 year: 2013 ident: 308_CR11 publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.01.001 – ident: 308_CR17 – volume: 17 start-page: 205 issue: 5 year: 1995 ident: 308_CR12 publication-title: Oper Res Lett doi: 10.1016/0167-6377(95)00023-D – volume-title: Scheduling: theory, algorithms, and systems year: 2008 ident: 308_CR22 – volume: 139 start-page: 293 issue: 2 year: 2002 ident: 308_CR7 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(01)00374-5 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 308_CR21 publication-title: OMEGA doi: 10.1016/0305-0483(83)90088-9 – volume: 33 start-page: 363 issue: 2 year: 1985 ident: 308_CR23 publication-title: Oper Res doi: 10.1287/opre.33.2.363 – volume-title: Machine sequencing problem: classification, complexity and computation year: 1976 ident: 308_CR25 – volume: 31 start-page: 142 issue: 2 year: 2003 ident: 308_CR8 publication-title: Oper Res Lett doi: 10.1016/S0167-6377(02)00215-8 – volume: 159 start-page: 420 issue: 2 year: 2004 ident: 308_CR1 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(03)00415-6 – volume: 26 start-page: 257 issue: 1 year: 1990 ident: 308_CR28 publication-title: Ann Oper Res doi: 10.1007/BF03500931 – volume: 51 start-page: 323 year: 2014 ident: 308_CR18 publication-title: Comput Oper Res doi: 10.1016/j.cor.2014.06.013 – ident: 308_CR24 – ident: 308_CR10 doi: 10.1007/3-540-45540-X_2 |
| SSID | ssj0000327848 ssib004298988 |
| Score | 2.1902168 |
| Snippet | We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 21 |
| SubjectTerms | Algorithms Business and Management Completion time Computational Intelligence Job shops Lower bounds Management Science Operations Research Operations Research/Decision Theory Original Paper Permutations Production scheduling Release dates |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT4QwEG509aAH38bV1fTgSdMILUvhZIzReDAbEx_ZG6EtdU1WQEH9-85UEDXRi7cmQAn5yjw60-8jZF8oH2ycNUyLVLNAZiFLvSxiYWwhfYCExHM8BXeXcjSKxuP4qtlwq5q2ytYmOkNtCo175EdcDEWMzoUfl08MVaOwutpIaMySOWRJ8F3r3vVXWxu1dFzOMgsss7nTcT4WFqJh1BY63Wk6eAfm1pIhiQuT311VF3_-KJk6T3S-_N9vWCFLTQxKTz4WzSqZyfI1sviFmXCdlCdUoeTGhKW5YQq1l2g6vYfJ6skjhUCXQuBI67eCPbpuTBgXEMZT16GeIdgUVeupnRZv1aQoaSNcQ6sXhTs_cDtFuRbwoRT3HKoNcnt-dnN6wRpxBkBVippBXKkCC1gGXCvFpeYZeMHA18L41ouCmHsmVCo2yKAWpnYoUsW1DAIjYCyM2CS9vMizLULBwupYQ-JjYTajLDLC8ygKQ2lsqDPRJ16LQ6Ib5nIU0JgmHecyQpcAdAlCl8g-Ofh8pPyg7fjr5kELV9L8wVXSYdUnhy3g3eVfJ9v-e7IdssAxY3ddbAPSq59fsl0yr1_rh-p5zy3fdzzU80I priority: 102 providerName: ProQuest |
| Title | A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates |
| URI | https://link.springer.com/article/10.1007/s12351-017-0308-7 https://www.proquest.com/docview/2353918532 |
| Volume | 20 |
| WOSCitedRecordID | wos000512993700002&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1866-1505 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327848 issn: 1109-2858 databaseCode: RSV dateStart: 20010101 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/eLvHCXMwnV1LT9wwEB7x6AEOhbZUbIGVD5yoLGXtbOwcAYE4wAoBBXqKYjvurrRsVptQ_n5nTMICaivBJXKUiRXNOPPwjL8B2JWmhzrOO25lbnmsioTnUaF5knoMHzAgiQJOwfWpGgz07W163pzjrtpq9zYlGTT1_LCbkH0KfRUnjBWuFmEZrZ2mfg0Xl9fPFaxuMbiCOpaUWwtH4nqUTdB93WY3_zbrS_s0dzpf5UmD-Tlee9eHr8PHxttk-4_L4xMsFJPPsPoMg_ALTPeZoeYaQ55PHDfUZYnl41_lbFQP7xi6tAxdRFY_lPwu1F3iuESHnYVa9ILEyqg_PfPj8qEallPWtKhh1b2hPR4kZ9SYBa0lo92FagN-HB9dHZ7wpg0Dyk_JmqMHaWKPUouFNUYoKwq0d3HPStfzkY5TEbnEmNQRVlqS-77MjbAqjp3EsXTyKyxNykmxCQx1qU0thjgeZ3PGE_a70DpJlPOJLWQHopb5mW0wyqlVxjiboysTMzNkZkbMzFQH9p5emT4CdPyPeLuVaNb8q1WGNDIlt0V04Hsrwfnjf0727U3UW7AiKFQP5WvbsFTP7osd-GB_16Nq1oVFdfOzC8sHR4PzC7w7iw7pqi67YXH_AQen7RE |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQceCOWFvABLiCrWdsbJ4cKVYWqVZcVh4J6C_GLrbS7WZqUFX-qv7Ez3oQtSPTWAzdLSSw7_jwPz_gbgNfS9FHGBcetLC1X2qe8THzG0zyg-4AOSRJ5Cr4O9WiUHR_nn9fgvLsLQ2mVnUyMgtpVls7It4QcyJyUi3g__8GpahRFV7sSGktYHPpfC3TZ6u2DD7i-b4TY-3i0u8_bqgI4HC0bjgaRUQEHoYQ1RmgrPIpv1bfS9UOSqVwkLjUmd0T9lZZhIEsjrFbKSWxLJ7HfG3BTKdwelCqY7F6W7VlH_xU1gaSwXryN16dARjbIusBqvL2HcyJfXnMijeH6T9W4snf_CtFGzbd3_3_7Zw_gXmtjs53lpngIa372CO5eYl58DPMdZqikyJiXM8cN1ZZi5eQ7Dr4ZTxka8gwNY9YsKj6N2abYrtBNYTED3xOYWXMy9SxMqkU9ruasLczD6jNDJ1v4OqNyNGgjMDpTqZ_Al2uZ8lNYn1Uz_wwYahCbW3TsAvbmTCDGe5FlaapdSK2XPUi6dS9sy8xOBUImxYpTmqBSIFQKgkqhe_D29yfzJS3JVS9vdvAoWglVFyts9OBdB7DV43929vzqzl7B7f2jT8NieDA63IA7gk4nYsbeJqw3p2f-BdyyP5uT-vRl3DoMvl037i4ANk9Odg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VghAcSoEiti98KBeQ1aydjZMDqqq2K6pWqx4A9RbiF1tpd7M0KSv-Wn8dM96k2yLRWw_cLMWx7OTzPDzjbwB2pO6ijPOWG1kYHiuX8CJyKU8yj-4DOiRR4Cn4dqoGg_T8PDtbguv2LgylVbYyMQhqWxo6I98VsiczUi5i1zdpEWeH_b3pT04VpCjS2pbTmEPkxP2eoftWfTo-xH_9Xoj-0ZeDz7ypMIBTU7LmaBzp2OOEYmG0FsoIh6I87hppuz5K40xENtE6s0QDlhS-JwstjIpjK7EtrcRxH8FjFaPapLTB6OC2nE9bKrCgFSSF-MLNvC4FNdJe2gZZw00-XB_59YoTgQxXd9Xkwvb9K1wbtGD_xf_8_VZhpbG92f58s7yEJTd5Bc9vMTK-huk-01RqZMiLieWaak6xYvQDJ18PxwwNfIYGM6tnJR-HLFRsl-i-sJCZ7wjkrL4YO-ZH5awallPWFOxh1ZWmEy_szqhMDdoOjM5aqjX4-iBLfgPLk3Li3gJDzWIygw6fx9Gs9sSEL9I0SZT1iXGyA1GLgdw0jO1UOGSUL7imCTY5wiYn2OSqAx9uXpnO6Uru67zZQiVvJFeVL3DSgY8t2BaP_znY-v2DvYOnCLf89HhwsgHPBB1ahES-TViuL6_cFjwxv-qL6nI77CIG3x8adn8AZbhXPA |
| 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=A+branch-and-bound+algorithm+for+the+two-machine+total+completion+time+flowshop+problem+subject+to+release+dates&rft.jtitle=Operational+research&rft.au=Rakrouki%2C+Mohamed+Ali&rft.au=Kooli%2C+Anis&rft.au=Chalghoumi%2C+Sabrine&rft.au=Ladhari%2C+Talel&rft.date=2020-03-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1109-2858&rft.eissn=1866-1505&rft.volume=20&rft.issue=1&rft.spage=21&rft.epage=35&rft_id=info:doi/10.1007%2Fs12351-017-0308-7&rft.externalDocID=10_1007_s12351_017_0308_7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1109-2858&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1109-2858&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1109-2858&client=summon |