{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:56:39Z","timestamp":1761486999797},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":[[1987]]},"DOI":"10.1016\/0305-0548(87)90029-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"257-264","source":"Crossref","is-referenced-by-count":33,"title":["Scheduling ordered open shops"],"prefix":"10.1016","volume":"14","author":[{"given":"C.Y.","family":"Liu","sequence":"first","affiliation":[]},{"given":"R.L.","family":"Bulfin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(87)90029-3_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: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. discr. Math."},{"key":"10.1016\/0305-0548(87)90029-3_BIB2","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":"J. ACM"},{"key":"10.1016\/0305-0548(87)90029-3_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/05695558308974639","article-title":"Route dependent open shop scheduling","volume":"15","author":"Adiri","year":"1983","journal-title":"IIE Trans."},{"key":"10.1016\/0305-0548(87)90029-3_BIB4","first-page":"306","article-title":"Scheduling the open shop to minimize mean flow time","volume":"9","author":"Achugbue","year":"1982","journal-title":"SIAM J. Gomput."},{"key":"10.1016\/0305-0548(87)90029-3_BIB5","article-title":"Special cases of openshop\u2014more than two machines\u2014schedule length problems","author":"Adiri","year":"1980"},{"key":"10.1016\/0305-0548(87)90029-3_BIB6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(84)90016-9","article-title":"Openshop and flowshop scheduling to minimize sum of completion times","volume":"11","author":"Adiri","year":"1984","journal-title":"Comput. Opns Res."},{"key":"10.1016\/0305-0548(87)90029-3_BIB7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.7.1.57","article-title":"Unit execution time shop problems","volume":"7","author":"Gonzalez","year":"1982","journal-title":"Math. Opns Res."},{"key":"10.1016\/0305-0548(87)90029-3_BIB8","article-title":"Scheduling open shops with unit execution times to minimize functions of due dates","author":"Liu","year":"1984"},{"key":"10.1016\/0305-0548(87)90029-3_BIB9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.8.1.100","article-title":"An algorithm for the open-shop problem","volume":"8","author":"Fiala","year":"1983","journal-title":"Math. Opns Res."},{"key":"10.1016\/0305-0548(87)90029-3_BIB10","first-page":"71","article-title":"On the complexity of preemptive open shop scheduling problems","volume":"4","author":"Liu","year":"1985","journal-title":"OR Lett."},{"key":"10.1016\/0305-0548(87)90029-3_BIB11","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":"Math. Opns Res."},{"key":"10.1016\/0305-0548(87)90029-3_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 Trans. Comput."},{"key":"10.1016\/0305-0548(87)90029-3_BIB13","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":"Opns Res."},{"key":"10.1016\/0305-0548(87)90029-3_BIB14","doi-asserted-by":"crossref","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming. Combinatorica. In press.","DOI":"10.1145\/800057.808695"},{"key":"10.1016\/0305-0548(87)90029-3_BIB15","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Sov. Math. Dokl."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054887900293?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054887900293?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:55:21Z","timestamp":1552913721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054887900293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0305054887900293"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(87)90029-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}