{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:22Z","timestamp":1794516742644,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":9,"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_235","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:06Z","timestamp":1461268986000},"page":"1312-1315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Flow Time"],"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":[{"key":"235_CR13493","doi-asserted-by":"crossref","unstructured":"Avrahami N, Azar Y (2003) Minimizing total flow time and completion time with immediate dispacthing. In: Proceedings of 15th SPAA, pp\u00a011\u201318","DOI":"10.1145\/777412.777415"},{"key":"235_CR13494","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 (2002) Minimizing the flow time without migration. SIAM J Comput 31:1370\u20131382","journal-title":"SIAM J Comput"},{"key":"235_CR13495","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 (2005) Minimizing flow time on a constant number of machines with preemption. Oper Res Lett 33:267\u2013273","journal-title":"Oper Res Lett"},{"key":"235_CR13496","doi-asserted-by":"crossref","unstructured":"Garg N, Kumar A (2006) Better algorithms for minimizing average flow-time on related machines. In: Proceesings of ICALP, pp\u00a0181\u2013190","DOI":"10.1007\/11786986_17"},{"key":"235_CR13497","doi-asserted-by":"crossref","unstructured":"Garg N, Kumar A (2006) Minimizing average flow time on related machines. In: ACM symposium on theory of compuring (STOC), pp\u00a0730\u2013738","DOI":"10.1145\/1132516.1132618"},{"key":"235_CR13498","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:1155\u20131166","journal-title":"SIAM J Comput"},{"key":"235_CR13499","volume-title":"Approximation and on-line algorithms","author":"S Leonardi","year":"2003","unstructured":"Leonardi S (2003) A simpler proof of preemptive flow-time approximation. In: Bampis E (ed) Approximation and on-line algorithms. Lecture notes in computer science. Springer, Berlin"},{"key":"235_CR13500","doi-asserted-by":"crossref","unstructured":"Leonardi S, Raz D (1997) Approximating total flow time on parallel machines. In: ACM symposium on theory of computing (STOC), pp\u00a0110\u2013119","DOI":"10.1145\/258533.258562"},{"key":"235_CR13501","first-page":"110","volume":"1997","author":"K Pruhs","year":"2004","unstructured":"Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Handbook on scheduling: algorithms, models and performance analysis. CRC, Boca Raton. Symposium on theory of computing (STOC), 1997, pp\u00a0110\u2013119","journal-title":"Symposium on theory of computing (STOC)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:55:42Z","timestamp":1792108542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_235","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"}}]}}