{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:31:01Z","timestamp":1743064261160,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":10,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_369","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"834-837","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Elapsed Time First Scheduling"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"369_CR1_369","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., K\u00f6nemann, J., Sinha, A.: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4), 305\u2013318 (2004)","journal-title":"Algorithmica"},{"key":"369_CR2_369","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the Lp norm: a\u00a0rising tide lifts all boat. In: Symposium on Theory of Computing, STOC, pp. 242\u2013250 (2003)","DOI":"10.1145\/780542.780580"},{"key":"369_CR3_369","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the weighted Lp norm. In: LATIN, pp.\u00a0434\u2013443 (2004)","DOI":"10.1007\/978-3-540-24698-5_47"},{"key":"369_CR4_369","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In: Symposium on Theory of Computing, STOC, pp.\u00a0363\u2013372 (2004)","DOI":"10.1145\/1007352.1007411"},{"issue":"4","key":"369_CR5_369","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539796305778","volume":"28","author":"H. Kellerer","year":"1999","unstructured":"Kellerer, H., Tautenhahn, T., Woeginger, G.J.: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a\u00a0Single Machine. SIAM J. Comput. 28(4), 1155\u20131166 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"369_CR6_369","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J.\u00a0ACM 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"369_CR7_369","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.: Non-Clairvoyant Scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"369_CR8_369","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.: Online Scheduling to Minimize Average Stretch. SIAM J. Comput. 34(2), 433\u2013452 (2004)","journal-title":"SIAM J. Comput."},{"key":"369_CR9_369","volume-title":"Operating System Projects Using Windows NT","author":"G. Nutt","year":"1999","unstructured":"Nutt, G.: Operating System Projects Using Windows NT. Addison Wesley, Reading (1999)"},{"key":"369_CR10_369","volume-title":"Modern Operating Systems","author":"A.S. Tanenbaum","year":"1992","unstructured":"Tanenbaum, A.S.: Modern Operating Systems. Prentice-Hall Inc., Englewood Cliffs (1992)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:51:42Z","timestamp":1662169902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_369"}},"subtitle":["2003; Bansal, Pruhs"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_369","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}