{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:47Z","timestamp":1759847867675},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0166-218x(00)00268-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:59:10Z","timestamp":1027634350000},"page":"133-150","source":"Crossref","is-referenced-by-count":8,"title":["On-line scheduling of small open shops"],"prefix":"10.1016","volume":"110","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[]},{"given":"Jiye","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jianjun","family":"Wen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00268-7_BIB1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(95)00039-9","article-title":"An optimal algorithm for preemptive on-line scheduling","volume":"18","author":"Chen","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(00)00268-7_BIB2","series-title":"Minimax and Applications","first-page":"97","article-title":"A study of on-line scheduling two-stage shops","author":"Chen","year":"1995"},{"key":"10.1016\/S0166-218X(00)00268-7_BIB3","series-title":"Handbook of Combinatorial Optimization, Vol. 3","first-page":"21","article-title":"A review of machine scheduling: Complexity, algorithms and approximability","author":"Chen","year":"1998"},{"key":"10.1016\/S0166-218X(00)00268-7_BIB4","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\/S0166-218X(00)00268-7_BIB5","series-title":"Logistics of Production and Inventory","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(00)00268-7_BIB6","series-title":"On-Line Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442","first-page":"196","article-title":"On-line scheduling","author":"Sgall","year":"1998"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002687?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002687?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T18:50:12Z","timestamp":1555699812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0166218X00002687"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00268-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}