{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:18:55Z","timestamp":1770967135772,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"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 & Operations Research"],"published-print":{"date-parts":[[2004,7]]},"DOI":"10.1016\/s0305-0548(03)00096-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"1349-1363","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling two-machine preemptive open shops to minimize total completion time"],"prefix":"10.1016","volume":"31","author":[{"given":"Ching-Fang","family":"Liaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00096-0_BIB1","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","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB3","unstructured":"Lenstra JK. Unpublished."},{"key":"10.1016\/S0305-0548(03)00096-0_BIB4","series-title":"Scheduling algorithms","author":"Brucker","year":"1995"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB5","series-title":"Scheduling: theory, algorithms, and systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB6","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(03)00096-0_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(03)00096-0_BIB8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","article-title":"A branch and bound algorithm for the open-shop problem","volume":"76","author":"Brucker","year":"1997","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/S0305-0548(03)00096-0_BIB9","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"},{"issue":"1","key":"10.1016\/S0305-0548(03)00096-0_BIB10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","article-title":"A hybrid genetic algorithm for the open shop scheduling problem","volume":"124","author":"Liaw","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0305-0548(03)00096-0_BIB11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB12","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1979.1675246","article-title":"A note on open shop preemptive schedules","volume":"C-28","author":"Gonzalez","year":"1979","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0605003","article-title":"Preemptive scheduling, linear programming and network flows","volume":"5","author":"de Werra","year":"1984","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB14","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1287\/opre.29.3.511","article-title":"Preemptive scheduling of independent jobs with release and due times on open, flow and job shops","volume":"29","author":"Cho","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/moor.6.1.153","article-title":"Minimizing maximum lateness in a two-machine open shop","volume":"6","author":"Lawler","year":"1981","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB16","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(94)90406-5","article-title":"On the complexity of preemptive openshop scheduling problems","volume":"77","author":"Sriskandarajah","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0377-2217(96)00249-4","article-title":"A two-machine preemptive openshop scheduling problem","volume":"103","author":"Gladky","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6377(85)90035-5","article-title":"On the complexity of preemptive open shop scheduling problem","volume":"4","author":"Liu","year":"1985","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/S0305-0548(03)00096-0_BIB19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0305-0548(87)90029-3","article-title":"Scheduling ordered open shops","volume":"14","author":"Liu","year":"1987","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(03)00096-0_BIB20","first-page":"25","article-title":"A branch-and-bound algorithm for the preemptive open shop scheduling problem","volume":"12","author":"Liu","year":"1995","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"key":"10.1016\/S0305-0548(03)00096-0_BIB21","unstructured":"Liaw C-F. Scheduling preemptive open shops to minimize total tardiness. European Journal of Operational Research, 2003; (in revision)."},{"key":"10.1016\/S0305-0548(03)00096-0_BIB22","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution of sequencing problems with precedence constraints","volume":"26","author":"Schrage","year":"1978","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000960?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000960?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:53:58Z","timestamp":1553165638000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["S0305054803000960"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00096-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,7]]}}}