{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:32Z","timestamp":1763468132114},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_2","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:20:16Z","timestamp":1372771216000},"page":"13-24","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines"],"prefix":"10.1007","author":[{"given":"S.","family":"Anand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl","family":"Bringmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naveen","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.orl.2004.10.006","volume":"33","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C., Mastrolilli, M.: On-line scheduling to minimize max flow time: An optimal preemptive algorithm. Oper. Res. Lett.\u00a033(6), 597\u2013602 (2005)","journal-title":"Oper. Res. Lett."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: 23rd Symp. Discrete Algorithms (SODA), pp. 1228\u20131241 (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-22006-7_20","volume-title":"Automata, Languages and Programming","author":"S. Anand","year":"2011","unstructured":"Anand, S., Garg, N., Megow, N.: Meeting deadlines: How much speed suffices? In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 232\u2013243. Springer, Heidelberg (2011)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y. Azar","year":"1995","unstructured":"Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. J.\u00a0Algorithms\u00a018(2), 221\u2013237 (1995)","journal-title":"J.\u00a0Algorithms"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the \u2113\n                    p\n                   norm: A rising tide lifts all boats. In: 35th Symp. Theory of Computing (STOC), pp. 242\u2013250 (2003)","DOI":"10.1145\/780579.780580"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-24698-5_47","volume-title":"LATIN 2004: Theoretical Informatics","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the weighted \u2113\n                    p\n                   norm. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 434\u2013443. Springer, Heidelberg (2004)"},{"key":"2_CR7","unstructured":"Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: 9th Symp. Discrete Algorithms (SODA), pp. 270\u2013279 (1998)"},{"key":"2_CR8","unstructured":"Bender, M.A., Muthukrishnan, S., Rajaraman, R.: Improved algorithms for stretch scheduling. In: 13th Symp. Discrete Algorithms (SODA), pp. 762\u2013771 (2002)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Moseley, B.: Online scheduling to minimize the maximum delay factor. In: 20th Symp. Discrete Algorithms (SODA), pp. 1116\u20131125 (2009)","DOI":"10.1137\/1.9781611973068.121"},{"key":"2_CR10","unstructured":"Golovin, D., Gupta, A., Kumar, A., Tangwongsan, K.: All-norms and all-\u2113\n                    p\n                  -norms approximation algorithms. In: 28th Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 199\u2013210 (2008)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B.: An online scalable algorithm for minimizing \u2113\n                    k\n                  -norms of weighted flow time on unrelated machines. In: 22nd Symp. Discrete Algorithms (SODA), pp. 95\u2013108 (2011)","DOI":"10.1137\/1.9781611973082.8"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"C.A. Phillips","year":"2002","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica\u00a032(2), 163\u2013200 (2002)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:34:09Z","timestamp":1557898449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}