{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:15:08Z","timestamp":1772831708209,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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,10]]},"DOI":"10.1016\/s0166-218x(00)00375-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"273-288","source":"Crossref","is-referenced-by-count":28,"title":["Linear time approximation scheme for the multiprocessor open shop problem"],"prefix":"10.1016","volume":"114","author":[{"given":"S.V.","family":"Sevastianov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00375-9_BIB1","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: Handbooks in Operations Research and Management Science, Vol. 4, S. Graves, A.H.G. Rinnooy Kan and P. Zipkin, eds., Logistics of Production and Inventory, Elsevier, North-Holland, Amsterdam, 1993, pp. 445\u2013522.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0166-218X(00)00375-9_BIB2","unstructured":"P. Schuurman, G.J. Woeginger, Approximation algorithms for the multiprocessor open shop problem, Report Woe-13, October 1997, TU Graz, Austria."},{"key":"10.1016\/S0166-218X(00)00375-9_BIB3","doi-asserted-by":"crossref","unstructured":"S.V. Sevastianov, I.D. Tchernykh, Computer-aided way to prove theorems in scheduling, in: Algorithms \u2014 ESA\u201998. Proceedings of the sixth Annual European Symposium, Venice, Italy, August 1998. Lecture Notes in Computer Science, Vol. 1461, Springer, Berlin, 1998, pp. 502\u2013513.","DOI":"10.1007\/3-540-68530-8_42"},{"key":"10.1016\/S0166-218X(00)00375-9_BIB4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585871","article-title":"Makespan minimization in open shops: A polynomial time approximation scheme","volume":"82","author":"Sevastianov","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00375-9_BIB5","series-title":"Discrete Analysis and Operations Research","first-page":"235","article-title":"Efficient scheduling in open shops","author":"Sevast'yanov","year":"1996"},{"key":"10.1016\/S0166-218X(00)00375-9_BIB6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","article-title":"Short shop schedules","volume":"45","author":"Williamson","year":"1997","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003759?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003759?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T21:26:44Z","timestamp":1578778004000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003759"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00375-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}