{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:56Z","timestamp":1742914076970,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":11,"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_146","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:59Z","timestamp":1214505359000},"page":"320-322","source":"Crossref","is-referenced-by-count":0,"title":["Flow Time Minimization"],"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":[{"issue":"4","key":"146_CR1_146","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/1008731.1008732","volume":"51","author":"L. Becchetti","year":"2004","unstructured":"Becchetti, L., Leonardi, S.: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J.\u00a0ACM 51(4), 517\u2013539 (2004)","journal-title":"J. ACM"},{"key":"146_CR2_146","unstructured":"Crovella, M.E., Frangioso, R., Harchal\u2010Balter, M.: Connection scheduling in web servers. In: Proceedings of the 2nd USENIX Symposium on Internet Technologies and Systems (USITS-99), 1999 pp.\u00a0243\u2013254"},{"issue":"4","key":"146_CR3_146","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1145\/792538.792545","volume":"50","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Pruhs, K.: Minimizing flow time nonclairvoyantly. J.\u00a0ACM 50(4), 551\u2013567 (2003)","journal-title":"J. ACM"},{"issue":"4","key":"146_CR4_146","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"},{"key":"146_CR5_146","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Tautenhahn, T., Woeginger, G.J.: Approximability and nonapproximability results for minimizing total flow time on a\u00a0single machine. In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing (STOC '96), 1996, pp.\u00a0418\u2013426","DOI":"10.1145\/237814.237989"},{"key":"146_CR6_146","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: Proceedings of the Annual ACM Symposium on the Theory of Computing STOC, 1997, pp.\u00a0110\u2013119","DOI":"10.1145\/258533.258562"},{"issue":"1","key":"146_CR7_146","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.: Nonclairvoyant scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"146_CR8_146","volume-title":"Operating System Projects Using Windows NT","author":"G. Nutt","year":"1999","unstructured":"Nutt, G.: Operating System Projects Using Windows NT. Addison\u2010Wesley, Reading (1999)"},{"issue":"1","key":"146_CR9_146","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L. Schrage","year":"1968","unstructured":"Schrage, L.: A\u00a0proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(1), 687\u2013690 (1968)","journal-title":"Oper. Res."},{"issue":"1","key":"146_CR10_146","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/opre.26.1.197","volume":"26","author":"D.R. Smith","year":"1976","unstructured":"Smith, D.R.: A\u00a0new proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 26(1), 197\u2013199 (1976)","journal-title":"Oper. Res."},{"key":"146_CR11_146","volume-title":"Modern Operating Systems","author":"A.S. Tanenbaum","year":"1992","unstructured":"Tanenbaum, A.S.: Modern Operating Systems. Prentice-Hall, 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_146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:16:11Z","timestamp":1662171371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_146"}},"subtitle":["2001; Becchetti, Leonardi, Marchetti-Spaccamela, Pruhs"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_146","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}