{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:14:29Z","timestamp":1740374069989,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_9","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:24:30Z","timestamp":1279841070000},"page":"67-77","source":"Crossref","is-referenced-by-count":1,"title":["Semi-clairvoyant Scheduling"],"prefix":"10.1007","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: ACM Symposim on Theory of Computing, pp. 198\u2013205 (1999)","DOI":"10.1145\/301250.301304"},{"key":"9_CR2","unstructured":"Bender, M., Muthukrishnan, S., Rajaraman, R.: Improved algorithms for stretch scheduling. In: ACM\/SIAM Symposium on Discrete Algorithms, pp. 762\u2013771 (2002)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Leonardi, S.: Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single and Parallel Machines. In: ACM Symposium on Theorey of Computing (2001)","DOI":"10.1145\/380752.380782"},{"issue":"2","key":"9_CR4","first-page":"181","volume":"6","author":"P. Berman","year":"1999","unstructured":"Berman, P., Coulston, C.: Speed is more powerful than clairvoyance. Nordic Journal of Computing\u00a06(2), 181\u2013193 (1999)","journal-title":"Nordic Journal of Computing"},{"key":"9_CR5","unstructured":"Crovella, M., Frangioso, R., Harchol-Balter, M.: Connection Scheduling in Web Servers. In: Proceedings of the 1999 USENIX Symposium on Internet Technologies and Systems (USITS 1999) (October 1999)"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0304-3975(99)00186-3","volume":"235","author":"J. Edmonds","year":"2000","unstructured":"Edmonds, J.: Scheduling in the dark. Theoretical Computer Science\u00a0235(1), 109\u2013141 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9_CR7","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. Journal of the ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"Journal of the ACM"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, B., Pruhs, K.: Minimizing flow time nonclairvoyantly. In: IEEE Symposium on Foundations of Computer Science (1997)","DOI":"10.1109\/SFCS.1997.646123"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Leonardi, S.: A simpler proof of preemptive total flow time approximation on parallel machines. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol.\u00a03484, pp. 203\u2013212. Springer, Heidelberg (2006) (to appear), http:\/\/www.dis.uniroma1.it\/~leon\/","DOI":"10.1007\/11671541_7"},{"key":"9_CR10","first-page":"110","volume-title":"ACM Symposium on Theory of Computing","author":"S. Leonardi","year":"1997","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: ACM Symposium on Theory of Computing, pp. 110\u2013119. El Paso, Texas (1997)"},{"key":"9_CR11","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. Theoretical Computer Science\u00a0130, 17\u201347 (1994)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Rajaraman, R., Shaheen, R., Gehrke, J.: Online scheduling to minimize average stretch. In: IEEE Symposium on Foundations of Compter Science, pp. 433\u2013442 (1997)","DOI":"10.1109\/SFFCS.1999.814615"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"C. Phillips","year":"2002","unstructured":"Phillips, C., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica\u00a032, 163\u2013200 (2002)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T07:37:58Z","timestamp":1740296278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}