{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:27Z","timestamp":1742617227924,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625926"},{"type":"electronic","value":"9783540683230"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62592-5_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:43:58Z","timestamp":1330296238000},"page":"74-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the drift of short schedules"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. Balanced allocations. In Proc. 26th ACM Symp. on Theory of Computing, pages 593\u2013602, 1994.","DOI":"10.1145\/195058.195412"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01940878","volume":"16","author":"R.M. Karp","year":"1996","unstructured":"R.M. Karp, M. Luby, and F. M. auf der Heide. Efficient PRAM simulation on a distribute memory machine. Algorithmica (1996) 16:517\u2013542.","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01215349","volume":"14","author":"T. Leighton","year":"1994","unstructured":"T. Leighton, B. Maggs, and S. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):165\u2013186, 1994.","journal-title":"Combinatorica"},{"key":"8_CR4","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":"8_CR5","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D. Shmoys","year":"1994","unstructured":"D. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23(3):617\u2013632, June 1994. A preliminary version of these results appeared in SODA '91.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62592-5_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:30:11Z","timestamp":1742599811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62592-5_62"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625926","9783540683230"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-62592-5_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}