{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:18:24Z","timestamp":1778563104514,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1007\/s10951-006-8789-x","type":"journal-article","created":{"date-parts":[[2006,7,22]],"date-time":"2006-07-22T00:49:48Z","timestamp":1153529388000},"page":"559-568","source":"Crossref","is-referenced-by-count":25,"title":["Lower bounds for minimizing total completion time in a two-machine flow shop"],"prefix":"10.1007","volume":"9","author":[{"given":"Han","family":"Hoogeveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"van Norden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steef","family":"van de Velde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8789_CR1","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(03)00415-6","volume":"159","author":"C. Akkan","year":"2004","unstructured":"Akkan, C. and S. Karabati, \u201cThe two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm,\u201d European Journal of Operational Research, 159, 420\u2013429 (2004).","journal-title":"European Journal of Operational Research"},{"key":"8789_CR2","first-page":"35","volume":"30","author":"B. W. Cadambi","year":"1993","unstructured":"Cadambi, B. W. and Y. S. Sathe, \u201cTwo-machine flowshop scheduling to minimise mean flow time,\u201d Opsearch, 30, 35\u201341 (1993).","journal-title":"Opsearch"},{"key":"8789_CR3","volume-title":"Theory of Scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., W. L. Maxwell, and L. W. Miller, Theory of Scheduling. Addison-Wesley, Reading, MA, (1967)."},{"key":"8789_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"F. Della Croce","year":"2002","unstructured":"Della Croce, F., M. Ghirardi, and R. Tadei, \u201cAn improved branch-and-bound algorithm for the two machine total completion time flow shop problem,\u201d European Journal of Operational Research, 139, 293\u2013301 (2002).","journal-title":"European Journal of Operational Research"},{"key":"8789_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F. Della Croce","year":"1996","unstructured":"Della Croce, F., V. Narayan, and R. Tadei, \u201cThe two-machine total completion time flow shop problem,\u201d European Journal of Operational Research, 90, 227\u2013237 (1996).","journal-title":"European Journal of Operational Research"},{"key":"8789_CR6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"M. R. Garey","year":"1976","unstructured":"Garey, M. R., D. S. Johnson, and R. Sethi, \u201cThe complexity of flowshop and jobshop scheduling,\u201d Mathematics of Operations Research, 13, 330\u2013348 (1976).","journal-title":"Mathematics of Operations Research"},{"key":"8789_CR7","first-page":"173","volume":"70","author":"J. A. Hoogeveen","year":"1995","unstructured":"Hoogeveen, J. A. and S. L. Van de Velde, \u201cStronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems,\u201d Mathematical Programming, 70, 173\u2013190 (1995).","journal-title":"Mathematical Programming"},{"key":"8789_CR8","first-page":"273","volume":"82","author":"J. A. Hoogeveen","year":"1998","unstructured":"Hoogeveen, J. A. and S. L. Van de Velde, \u201cScheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine,\u201d Mathematical Programming, 82, 273\u2013289 (1998).","journal-title":"Mathematical Programming"},{"key":"8789_CR9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E. Ignall","year":"1965","unstructured":"Ignall, E., and L. E. Scharge, \u201cApplication of the branch and bound technique to some flow-shop problems,\u201d Operations Research, 13, 400\u2013412 (1965).","journal-title":"Operations Research"},{"key":"8789_CR10","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/321864.321872","volume":"22","author":"W. H. Kohler","year":"1975","unstructured":"Kohler, W. H. and K. Steiglitz, \u201cExact, approximate and guaranteed accuracy algorithms for the flowshop problem n\/2\/F\/F,\u201d Journal ACM, 22, 106\u2013114 (1975).","journal-title":"Journal ACM"},{"key":"8789_CR11","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0377-2217(98)00009-5","volume":"113","author":"S. Sayin","year":"1999","unstructured":"Sayin, S. and S. Karabati, \u201cA bicriteria approach to the two-machine flow shop scheduling problem,\u201d European Journal of Operational Research, 113, 435\u2013449 (1999).","journal-title":"European Journal of Operational Research"},{"key":"8789_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03500931","volume":"26","author":"S. L Velde Van de","year":"1990","unstructured":"Van de Velde, S. L, \u201cMinimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation,\u201d Annals of Operations Research, 26, 257\u2013268 (1990).","journal-title":"Annals of Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8789-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8789-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8789-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:10:13Z","timestamp":1587118213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8789-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["8789"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8789-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}