{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:35:37Z","timestamp":1773326137512,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0305-0548(01)00028-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:31:41Z","timestamp":1027593101000},"page":"1251-1266","source":"Crossref","is-referenced-by-count":11,"title":["The total completion time open shop scheduling problem with a given sequence of jobs on one machine"],"prefix":"10.1016","volume":"29","author":[{"given":"Ching-Fang","family":"Liaw","sequence":"first","affiliation":[]},{"given":"Chun-Yuan","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Mingchih","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00028-4_BIB1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1018930613891","article-title":"A new lower bound for the open-shop problem","volume":"92","author":"Gueret","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F","article-title":"The open shop scheduling problem with a given sequence of jobs on one machine","volume":"45","author":"Sharfransky","year":"1998","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB3","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1137\/0211058","article-title":"Scheduling the open shop to minimize mean flow time","volume":"11","author":"Achugbue","year":"1982","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","article-title":"A branch & bound algorithm for the open-shop problem","volume":"76","author":"Brucker","year":"1997","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"10.1016\/S0305-0548(01)00028-4_BIB5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzales","year":"1976","journal-title":"Journal of the ACM"},{"issue":"2","key":"10.1016\/S0305-0548(01)00028-4_BIB6","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(97)00332-9","article-title":"Classical and new heuristics for the open-shop problem","volume":"107","author":"Gueret","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02243845","article-title":"Constructive heuristic algorithms for the open shop problem","volume":"51","author":"Brasel","year":"1993","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB8","series-title":"Scheduling theory","author":"Tanaev","year":"1994"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1018997431986","article-title":"Shop scheduling problems under precedence constraints","volume":"69","author":"Strusevich","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB10","series-title":"Knapsack problem","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","article-title":"Algorithms for solving production scheduling problems","volume":"8","author":"Giffler","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB12","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"EJOR"},{"key":"10.1016\/S0305-0548(01)00028-4_BIB13","series-title":"Computers and intractability","author":"Garey","year":"1979"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000284?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000284?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T21:55:04Z","timestamp":1556834104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0305054801000284"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00028-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}