{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:43:08Z","timestamp":1773326588449,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"4","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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0167-6377(02)00115-3","type":"journal-article","created":{"date-parts":[[2002,10,3]],"date-time":"2002-10-03T19:36:09Z","timestamp":1033673769000},"page":"276-280","source":"Crossref","is-referenced-by-count":6,"title":["A linear time approximation scheme for makespan minimization in an open shop with release dates"],"prefix":"10.1016","volume":"30","author":[{"given":"Alexander","family":"Kononov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00115-3_BIB1","first-page":"177","article-title":"Nearly optimum solution of multimachine scheduling problems","volume":"15","author":"Barany","year":"1982","journal-title":"Szigma Mat. Kozgazdasagi Folyoirat"},{"key":"10.1016\/S0167-6377(02)00115-3_BIB2","unstructured":"A. Bo Chen, P.A. Vestjens, G.J. Woeginger, On-line scheduling of two-machine open shops where jobs arrive over time, SFB-Report 68, Mai, TU Graz, Austria, 1996."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB3","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/BF01585870","article-title":"Approximability of flow shop scheduling","volume":"82","author":"Hall","year":"1998","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB5","doi-asserted-by":"crossref","unstructured":"L.A. Hall, D.B. Shmoys, Approximation algorithms for constrained scheduling problems, Proceedings of the IEEE 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 134\u2013139.","DOI":"10.1109\/SFCS.1989.63468"},{"key":"10.1016\/S0167-6377(02)00115-3_BIB6","unstructured":"L.A. Hall, D.B. Shmoys, Near-optimal sequencing with precedence constraints, Proceedings of the Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization, University of Waterloo, 1990, pp. 249\u2013260."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.17.1.22","article-title":"Jackson's rule for single machine scheduling: making a good heuristic better","volume":"17","author":"Hall","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB8_1","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Minimizing maximum lateness in a two machine open shop, Math. Oper. Res. 6, 153\u2013158.","DOI":"10.1287\/moor.6.1.153"},{"key":"10.1016\/S0167-6377(02)00115-3_BIB8_2","unstructured":"Erraturm. 7, 635."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB9","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 Operation Research and Management Science, Vol. 4, North-Holland, Amsterdam, 1993, pp. 445\u2013522.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0167-6377(02)00115-3_BIB10","unstructured":"P. Schuurman, G.J. Woeginger, Approximation algorithms for the multiprocessor open shop problem, Report Woe-13, TU-Graz, Austria, 1997, Oper. Res. Lett., to appear."},{"key":"10.1016\/S0167-6377(02)00115-3_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585871","article-title":"Makespan minimization in open shops: a polynomial time approximation","volume":"82","author":"Sevastianov","year":"1998","journal-title":"Math. Program., Ser. B"},{"key":"10.1016\/S0167-6377(02)00115-3_BIB12","unstructured":"S.V. Sevastianov, G.J. Woeginger, PTAS for makespan minimization in multiprocessor open shop, Disc. Anal. Oper. Res., to appear."},{"issue":"2","key":"10.1016\/S0167-6377(02)00115-3_BIB13","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":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001153?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001153?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:30:58Z","timestamp":1580898658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0167637702001153"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00115-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}