{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:25Z","timestamp":1794516745513,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":10,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_369","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"1966-1969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Elapsed Time First Scheduling"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"4","key":"369_CR19229","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00453-004-1115-0","volume":"40","author":"N Bansal","year":"2004","unstructured":"Bansal N, Dhamdhere K, Konemann J, Sinha A (2004) Non-clairvoyant scheduling for minimizing mean slowdown. Algorithmica 40(4):305\u2013318","journal-title":"Algorithmica"},{"key":"369_CR19230","first-page":"242","volume-title":"scheduling in the Lp norm: a rising tide lifts all boat","author":"N Bansal","year":"2003","unstructured":"Bansal N, Pruhs K (2003) Server scheduling in the Lp norm: a rising tide lifts all boat. In: Symposium on theory of computing (STOC), San Diego, pp\u00a0242\u2013250"},{"key":"369_CR19231","first-page":"434","volume-title":"Server scheduling in the weighted Lp norm","author":"N Bansal","year":"2004","unstructured":"Bansal N, Pruhs K (2004) Server scheduling in the weighted Lp norm. In: LATIN, Buenos Aires, pp\u00a0434\u2013443"},{"key":"369_CR19232","doi-asserted-by":"crossref","unstructured":"Chekuri C, Goel A, Khanna S, Kumar A (2004) Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In: Symposium on theory of computing (STOC), Chicago, pp\u00a0363\u2013372","DOI":"10.1145\/1007352.1007411"},{"issue":"4","key":"369_CR19233","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 47(4):617\u2013643","journal-title":"J ACM"},{"issue":"4","key":"369_CR19234","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539796305778","volume":"28","author":"H Kellerer","year":"1999","unstructured":"Kellerer H, Tautenhahn T, Woeginger GJ (1999) Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM J Comput 28(4):1155\u20131166","journal-title":"SIAM J Comput"},{"issue":"1","key":"369_CR19235","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R Motwani","year":"1994","unstructured":"Motwani R, Phillips S, Torng E (1994) Non-clairvoyant scheduling. Theor Comput Sci 130(1):17\u201347","journal-title":"Theor Comput Sci"},{"issue":"2","key":"369_CR19236","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/S0097539701387544","volume":"34","author":"S Muthukrishnan","year":"2004","unstructured":"Muthukrishnan S, Rajaraman R, Shaheen A, Gehrke J (2004) Online scheduling to minimize average stretch. SIAM J Comput 34(2):433\u2013452","journal-title":"SIAM J Comput"},{"key":"369_CR19237","volume-title":"Operating system projects using Windows NT","author":"G Nutt","year":"1999","unstructured":"Nutt G (1999) Operating system projects using Windows NT. Addison Wesley, Reading"},{"key":"369_CR19238","volume-title":"Modern operating systems","author":"AS Tanenbaum","year":"1992","unstructured":"Tanenbaum AS (1992) Modern operating systems. Prentice-Hall, Englewood Cliffs"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:53:07Z","timestamp":1792108387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_369","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}