{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:59:27Z","timestamp":1725861567802},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_39","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"483-495","source":"Crossref","is-referenced-by-count":2,"title":["Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine"],"prefix":"10.1007","author":[{"given":"Pierre-Francois","family":"Dutot","sequence":"first","affiliation":[]},{"given":"Erik","family":"Saule","sequence":"additional","affiliation":[]},{"given":"Abhinav","family":"Srivastav","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2001","unstructured":"Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, New York (2001)","edition":"3"},{"key":"39_CR2","unstructured":"Bender, M., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the SODA, pp. 270\u2013279 (1998)"},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. Handbooks Oper. Res. Manag. Sci. 4, 445\u2013522 (1993)","journal-title":"Handbooks Oper. Res. Manag. Sci."},{"issue":"4","key":"39_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.jpdc.2011.12.007","volume":"72","author":"E Saule","year":"2012","unstructured":"Saule, E., Bozda\u011f, D., \u00c7ataly\u00fcrek, \u00cd.V.: Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks. J. Parallel Distrib. Comput. 72(4), 489\u2013503 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"39_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10951-008-0078-4","volume":"11","author":"A Legrand","year":"2008","unstructured":"Legrand, A., Su, A., Vivien, F.: Minimizing the stretch when scheduling flows of divisible requests. J. Sched. 11(5), 381\u2013404 (2008)","journal-title":"J. Sched."},{"key":"39_CR6","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS, Boston (1997)"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the Lp norm: a rising tide lifts all boat. In: Proceedings of the ACM STOC, pp. 242\u2013250 (2003)","DOI":"10.1145\/780542.780580"},{"key":"39_CR8","unstructured":"Golovin, D., Gupta, A., Kumar, A., Tangwongsan, K.: All-norms and all-Lp-norms approximation algorithms. In: Proceedings of the FSTTCS, pp. 199\u2013210 (2008)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B.: An online scalable algorithm for minimizing $$l_k$$ -norms of weighted flow time on unrelated machines. In: Proceedings of the ACM-SIAM SODA, pp. 98\u2013108 (2011)","DOI":"10.1137\/1.9781611973082.8"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proceedings of the ACM-SIAM SODA, pp. 1228\u20131241 (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0167-6377(03)00016-6","volume":"31","author":"X Lu","year":"2003","unstructured":"Lu, X., Sitters, R.A., Stougie, L.: A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31, 232\u2013236 (2003)","journal-title":"Oper. Res. Lett."},{"key":"39_CR12","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.orl.2003.11.008","volume":"32","author":"N Megow","year":"2003","unstructured":"Megow, N., Schulz, A.S.: On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32, 485\u2013490 (2003)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T11:04:25Z","timestamp":1568199865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}