{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:31:18Z","timestamp":1742949078837,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"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_235","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"531-533","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Flow Time"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"235_CR1_235","doi-asserted-by":"crossref","unstructured":"Avrahami, N., Azar, Y.: Minimizing total flow time and completion time with immediate dispacthing. In: Proceedings of 15th SPAA, pp.\u00a011\u201318. (2003)","DOI":"10.1145\/777412.777415"},{"key":"235_CR2_235","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1137\/S009753970037446X","volume":"31","author":"B. Awerbuch","year":"2002","unstructured":"Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. SIAM J. Comput. 31, 1370\u20131382 (2002)","journal-title":"SIAM J. Comput."},{"key":"235_CR3_235","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.orl.2004.07.008","volume":"33","author":"N. Bansal","year":"2005","unstructured":"Bansal, N.: Minimizing flow time on a\u00a0constant number of machines with preemption. Oper. Res. Lett. 33, 267\u2013273 (2005)","journal-title":"Oper. Res. Lett."},{"key":"235_CR4_235","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Proceesings of ICALP, pp.\u00a0181\u2013190 (2006)","DOI":"10.1007\/11786986_17"},{"key":"235_CR5_235","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, A.: Minimizing average flow time on related machines. In: ACM Symposium on Theory of Compuring (STOC), pp.\u00a0730\u2013738 (2006)","DOI":"10.1145\/1132516.1132618"},{"key":"235_CR6_235","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, 1155\u20131166 (1999)","journal-title":"SIAM J. Comput."},{"key":"235_CR7_235","volume-title":"Lecture Notes in Computer Science","author":"S. Leonardi","year":"2003","unstructured":"Leonardi, S.: A\u00a0simpler proof of preemptive flow-time approximation. Approximation and On-line Algorithms. In: Bampis, E. (ed.) Lecture Notes in Computer Science. Springer, Berlin (2003)"},{"key":"235_CR8_235","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: ACM Symposium on Theory of Computing (STOC), pp.\u00a0110\u2013119 (1997)","DOI":"10.1145\/258533.258562"},{"key":"235_CR9_235","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook on Scheduling: Algorithms, Models and Performance Analysis, CRC press (2004). Symposium on Theory of Computing (STOC), pp.\u00a0110\u2013119. (1997)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:16:52Z","timestamp":1662175012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_235"}},"subtitle":["1997; Leonardi, Raz"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_235","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}