{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:49:50Z","timestamp":1777639790025,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T00:00:00Z","timestamp":1491868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s12351-017-0308-7","type":"journal-article","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T02:58:23Z","timestamp":1491879503000},"page":"21-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates"],"prefix":"10.1007","volume":"20","author":[{"given":"Mohamed Ali","family":"Rakrouki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anis","family":"Kooli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrine","family":"Chalghoumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talel","family":"Ladhari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,11]]},"reference":[{"issue":"2","key":"308_CR1","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(03)00415-6","volume":"159","author":"C Akkan","year":"2004","unstructured":"Akkan C, Karabati S (2004) The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm. Eur J Oper Res 159(2):420\u2013429","journal-title":"Eur J Oper Res"},{"key":"308_CR2","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"issue":"3","key":"308_CR3","first-page":"306","volume":"9","author":"SP Bansal","year":"1977","unstructured":"Bansal SP (1977) Minimizing the sum of completion times of n jobs over m machines in a flow shop. Am Inst Ind Eng Trans 9(3):306\u2013311","journal-title":"Am Inst Ind Eng Trans"},{"key":"308_CR4","doi-asserted-by":"crossref","unstructured":"Chalghoumi S, Mehdi M, Ladhari T (2013) A new lower bound for minimising the total completion time in a two-machine flow shop under release dates. In: IEEE international conference on modeling, simulation and applied optimization, Hammamet, April 28\u201330, 2013, pp 1\u20134","DOI":"10.1109\/ICMSAO.2013.6552646"},{"issue":"3","key":"308_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0925-5273(02)00234-7","volume":"79","author":"CS Chung","year":"2002","unstructured":"Chung CS, Flynn J, Kirca O (2002) A branch-and-bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. Int J Prod Econ 79(3):185\u2013196","journal-title":"Int J Prod Econ"},{"issue":"2","key":"308_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F Della Croce","year":"1996","unstructured":"Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flowshop problem. Eur J Oper Res 90(2):227\u2013237","journal-title":"Eur J Oper Res"},{"issue":"2","key":"308_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"F Della Croce","year":"2002","unstructured":"Della Croce F, Ghirardi M, Tadei R (2002) An improved branch-and-bound algorithm for the two machine total completion time flowshop problem. Eur J Oper Res 139(2):293\u2013301","journal-title":"Eur J Oper Res"},{"issue":"2","key":"308_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/S0167-6377(02)00215-8","volume":"31","author":"F Della Croce","year":"2003","unstructured":"Della Croce F, T\u2019Kindt V (2003) Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. Oper Res Lett 31(2):142\u2013148","journal-title":"Oper Res Lett"},{"key":"308_CR9","volume-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"S French","year":"1982","unstructured":"French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job-shop. Ellis Horwood, Chichester"},{"key":"308_CR10","doi-asserted-by":"crossref","unstructured":"Harchol-Balter H, Bansal N, Schroeder B, Agrawal M (2001) SRPT Scheduling for web servers. Lecture notes in computer science, chapter in job scheduling strategies for parallel processing. Springer, pp 11\u201320","DOI":"10.1007\/3-540-45540-X_2"},{"issue":"7","key":"308_CR11","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.cor.2013.01.001","volume":"40","author":"M Haouari","year":"2013","unstructured":"Haouari M, Kharbeche M (2013) An assignment-based lower bound for a class of two-machine flow shop problems. Comput Oper Res 40(7):1693\u20131699","journal-title":"Comput Oper Res"},{"issue":"5","key":"308_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0167-6377(95)00023-D","volume":"17","author":"JA Hoogeveen","year":"1995","unstructured":"Hoogeveen JA, Van de Velde S (1995) Minimizing total completion and maximum cost simultaneously is solvable in polynomial time. Oper Res Lett 17(5):205\u2013208","journal-title":"Oper Res Lett"},{"issue":"6","key":"308_CR13","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10951-006-8789-x","volume":"9","author":"H Hoogeveen","year":"2006","unstructured":"Hoogeveen H, Van Norden L, Van de Velde S (2006) Lower bounds for minimizing total completion time in a two-machine flow shop. J Sched 9(6):559\u2013568","journal-title":"J Sched"},{"issue":"3","key":"308_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E Ignall","year":"1965","unstructured":"Ignall E, Schrage L (1965) Application of the branch-and-bound technique to some flowshop scheduling problems. Oper Res 13(3):400\u2013412","journal-title":"Oper Res"},{"key":"308_CR15","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"A Jouglet","year":"2004","unstructured":"Jouglet A, Baptiste P, Carlier J (2004) Branch-and-bound algorithms for total weighted tardiness. In: Leung JYT (ed) Handbook of scheduling: algorithms, models and performance analysis. CRC Press, FL, USA"},{"issue":"4","key":"308_CR16","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539796305778","volume":"28","author":"H Kellerer","year":"1999","unstructured":"Kellerer H, Tautenhahn T, Woeginger GJ (1999) Approximability and non approximability results for minimizing total flow time on a single machine. SIAM J Comput 28(4):1155\u20131166","journal-title":"SIAM J Comput"},{"key":"308_CR17","unstructured":"Kooli A, Serairi M (2013) An assignment based lower bound for the single machine with unequal release dates. In: 11th Workshop on models and algorithms for planning and scheduling problems, Pont \u00e0 Mousson, 23\u201328 June, 2013"},{"key":"308_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.cor.2014.06.013","volume":"51","author":"A Kooli","year":"2014","unstructured":"Kooli A, Serairi M (2014) A mixed integer programming approach for the single machine problem with unequal release dates. Comput Oper Res 51:323\u2013330","journal-title":"Comput Oper Res"},{"issue":"2","key":"308_CR19","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.ijpe.2009.06.031","volume":"122","author":"T Ladhari","year":"2009","unstructured":"Ladhari T, Rakrouki MA (2009) Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop. Int J Prod Econ 122(2):678\u2013691","journal-title":"Int J Prod Econ"},{"issue":"6","key":"308_CR20","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jcss.2006.10.018","volume":"73","author":"S Leonardi","year":"1997","unstructured":"Leonardi S, Raz D (1997) Approximating total flow time on parallel machines. J Comput Syst Sci 73(6):875\u2013891","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"308_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \n$$m$$\n\n\n\nm\n\n\n\n-machine, \n$$n$$\n\n\n\nn\n\n\n\n-job flow-shop sequencing problem. OMEGA 11(1):91\u201396","journal-title":"OMEGA"},{"key":"308_CR22","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo M (2008) Scheduling: theory, algorithms, and systems. Springer, New York"},{"issue":"2","key":"308_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts CN, Van Wassenhove LN (1985) A branch-and-bound algorithm for the total weighted tardiness problem. Oper Res 33(2):363\u2013377","journal-title":"Oper Res"},{"key":"308_CR24","unstructured":"Rakrouki MA, Ladhari T (2009) A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates. In: IEEE international conference on computers & industrial engineering, University of Technology of Troyes, July 6\u20138, 2009, pp 80\u201385"},{"key":"308_CR25","volume-title":"Machine sequencing problem: classification, complexity and computation","author":"AHG Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan AHG (1976) Machine sequencing problem: classification, complexity and computation. Nijhoff, The Hague"},{"issue":"2","key":"308_CR26","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1080\/05695558308974629","volume":"15","author":"W Szwarc","year":"1983","unstructured":"Szwarc W (1983) The flow shop problem with mean completion time criterion. IIE Trans 15(2):172\u2013176","journal-title":"IIE Trans"},{"issue":"6","key":"308_CR27","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1023\/B:JOSH.0000046075.73409.7d","volume":"7","author":"V T\u2019Kindt","year":"2004","unstructured":"T\u2019Kindt V, Della Croce F, Esswein C (2004) Revisiting branch and bound search strategies for machine scheduling problems. J Sched 7(6):429\u2013440","journal-title":"J Sched"},{"issue":"1","key":"308_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF03500931","volume":"26","author":"S Velde Van de","year":"1990","unstructured":"Van de Velde S (1990) Minimizing the sum of job completion times in the two-machine flowshop by Lagrangian relaxation. Ann Oper Res 26(1):257\u2013268","journal-title":"Ann Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0308-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0308-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0308-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T15:03:11Z","timestamp":1581519791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0308-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,11]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["308"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0308-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,11]]},"assertion":[{"value":"26 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}