{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T14:00:30Z","timestamp":1719928830980},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T00:00:00Z","timestamp":1445817600000},"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":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0082-y","type":"journal-article","created":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T20:35:47Z","timestamp":1445891747000},"page":"515-536","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines"],"prefix":"10.1007","volume":"77","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","published-online":{"date-parts":[[2015,10,26]]},"reference":[{"issue":"6","key":"82_CR1","doi-asserted-by":"crossref","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. 33(6), 597\u2013602 (2005)","journal-title":"Oper. Res. Lett."},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Megow, N.: Meeting deadlines: how much speed suffices? In: 38th International colloquium on automata, languages and programming (ICALP), pp. 232\u2013243 (2011)","DOI":"10.1007\/978-3-642-22006-7_20"},{"key":"82_CR3","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: 23rd Symposium on discrete algorithms (SODA), pp. 1228\u20131241 (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"82_CR4","doi-asserted-by":"crossref","unstructured":"Anand, S., Bringmann, K., Friedrich, T., Garg, N., Kumar, A.: Minimizing maximum (weighted) flow-time on related and unrelated machines. In: 40th International colloquium on automata, languages and programming (ICALP), pp. 13\u201324 (2013)","DOI":"10.1007\/978-3-642-39206-1_2"},{"issue":"2","key":"82_CR5","doi-asserted-by":"crossref","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. Algorithms 18(2), 221\u2013237 (1995)","journal-title":"J. Algorithms"},{"issue":"1","key":"82_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1006\/jagm.1995.0799","volume":"22","author":"Y Azar","year":"1997","unstructured":"Azar, Y., Kalyanasundaram, B., Plotkin, S.A., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. J. Algorithms 22(1), 93\u2013110 (1997)","journal-title":"J. Algorithms"},{"key":"82_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the $$\\ell _{p}$$ \u2113 p norm: a rising tide lifts all boats. In: 35th Symposium on theory of computing (STOC), pp. 242\u2013250 (2003)","DOI":"10.1145\/780542.780580"},{"key":"82_CR8","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the weighted $$\\ell _{p}$$ \u2113 p norm. In: 6th Latin American theoretical informatics conference (LATIN), pp. 434\u2013443 (2004)","DOI":"10.1007\/978-3-540-24698-5_47"},{"key":"82_CR9","unstructured":"Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: 9th Symposium on discrete algorithms (SODA), pp. 270\u2013279 (1998)"},{"key":"82_CR10","unstructured":"Bender, M.A., Muthukrishnan, S., Rajaraman, R.: Improved algorithms for stretch scheduling. In: 13th Symposium on discrete algorithms (SODA), pp. 762\u2013771 (2002)"},{"key":"82_CR11","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Moseley, B.: Online scheduling to minimize the maximum delay factor. In: 20th Symposium on discrete algorithms (SODA), pp. 1116\u20131125 (2009)","DOI":"10.1137\/1.9781611973068.121"},{"issue":"2","key":"82_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"AP Cynthia","year":"2002","unstructured":"Cynthia, A.P., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2), 163\u2013200 (2002)","journal-title":"Algorithmica"},{"key":"82_CR13","unstructured":"Golovin, D., Gupta, A., Kumar, A., Tangwongsan, K.: All-norms and all- $$\\ell _{p}$$ \u2113 p -norms approximation algorithms. In: 28th Conference foundations of software technology and theoretical computer science (FSTTCS), pp. 199\u2013210 (2008)"},{"key":"82_CR14","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B.: An online scalable algorithm for minimizing $$\\ell _{k}$$ \u2113 k -norms of weighted flow time on unrelated machines. In: 22nd Symposium on discrete algorithms (SODA), pp. 95\u2013108 (2011)","DOI":"10.1137\/1.9781611973082.8"},{"key":"82_CR15","unstructured":"Lam, T.W., To, K.-K.: Trade-offs between speed and processor in hard-deadline scheduling. In: 10th Symposium discrete algorithms (SODA), pp. 623\u2013632 (1999)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0082-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0082-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0082-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0082-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:10:29Z","timestamp":1567296629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0082-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,26]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0082-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,26]]}}}