{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:55:02Z","timestamp":1648850102052},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00326-7","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"473-484","source":"Crossref","is-referenced-by-count":0,"title":["On the drift of short schedules"],"prefix":"10.1016","volume":"289","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giora","family":"Rayzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(01)00326-7_BIB1","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","article-title":"Balanced allocations","volume":"29","author":"Azar","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00326-7_BIB2","doi-asserted-by":"crossref","unstructured":"U. Feige, C. Scheideler, Improved bounds for acyclic job shop scheduling, Proc. 30th ACM Symp. on Theory of Computing, 1998 pp. 624\u2013633.","DOI":"10.1145\/276698.276878"},{"key":"10.1016\/S0304-3975(01)00326-7_BIB3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01940878","article-title":"Efficient PRAM simulation on a distribute memory machine","volume":"16","author":"Karp","year":"1996","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/S0304-3975(01)00326-7_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01215349","article-title":"Packet routing and job-shop scheduling in O(congestion + dilation) steps","volume":"14","author":"Leighton","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(01)00326-7_BIB5","unstructured":"G. Rayzman, Approximation techniques for job-shop scheduling problems, Master's Thesis, Department of Applied Math and Computer Science, The Weizmann Institute of Science, 1996."},{"issue":"3","key":"10.1016\/S0304-3975(01)00326-7_BIB6","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","article-title":"Improved approximation algorithms for shop scheduling problems","volume":"23","author":"Shmoys","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00326-7_BIB7","unstructured":"Y.N. Sotskov, N.V. Shaklevich, NP-hardness of scheduling problems with three jobs, Vestsi Akad. Navuk BSSR Ser. Fiz.\u2013Mat. Navuk (4) 1990 96\u2013101."},{"key":"10.1016\/S0304-3975(01)00326-7_BIB8","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:55:55Z","timestamp":1583776555000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003267"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00326-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}