{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:34:00Z","timestamp":1770500040808,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0377-2217(01)00374-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"293-301","source":"Crossref","is-referenced-by-count":72,"title":["An improved branch-and-bound algorithm for the two machine total completion time flow shop problem"],"prefix":"10.1016","volume":"139","author":[{"given":"F.","family":"Della Croce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ghirardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Tadei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0377-2217(01)00374-5_BIB1","first-page":"35","article-title":"Two-machine flowshop scheduling to minimize mean flow time","volume":"30","author":"Cadambi","year":"1993","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB2","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(95)00009-F","article-title":"Generalized pairwise interchanges and machine scheduling","volume":"83","author":"Della Croce","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","article-title":"The two machine total completion time flow shop problem","volume":"90","author":"Della Croce","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585935","article-title":"Stronger Lagrangean bounds by use of slack variables: Application to machine scheduling problems","volume":"70","author":"Hoogeveen","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB8","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1287\/moor.24.4.887","article-title":"Minimizing total completion time in a two-machine flowshop: Analysis of special cases","volume":"24","author":"Hoogeveen","year":"1999","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch-and-bound technique to some flow-shop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03500931","article-title":"Minimizing the sum of job completion times in the two-machine flow-shop by Lagrangean relaxation","volume":"26","author":"Van de Velde","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00374-5_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0925-5273(96)00060-6","article-title":"Efficient heuristics and optimal approaches for n\/2\/F\/\u2211Ci scheduling problems","volume":"44","author":"Wang","year":"1996","journal-title":"International Journal of Production Economics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:52:25Z","timestamp":1578545545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701003745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0377221701003745"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00374-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}