{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:13Z","timestamp":1751634253099,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_8","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"36-47","source":"Crossref","is-referenced-by-count":16,"title":["Online Weighted Flow Time and Deadline Scheduling"],"prefix":"10.1007","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[]},{"given":"Kirk R.","family":"Pruhs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"S. Aacharya, and S. Muthukrishnan, \u201cScheduling on-demand broadcasts: new metrics and algorithms\u201d, 4th ACM\/IEEE International Conference on Mobile Computing and Networking, 43\u201354, 1998.","DOI":"10.1145\/288235.288248"},{"key":"8_CR2","unstructured":"Y. Bartal, and S. Muthukrishnan, \u201cMinimizing Maximum Response Time in Scheduling Broadcasts\u201d, 558\u2013559, Proceedings of the Eleventh Annual ACM\/SIAM Symposium on Discrete Algorithms, pages 558\u2013559, 2000."},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-61310-2_22","volume-title":"Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO 96)","author":"M. Goemans","year":"1996","unstructured":"M. Goemans, \u201cA Supermodular Relaxation for Scheduling with Release Dates\u201d. In Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO 96), LNCS 1084, Springer, pp. 288\u2013300, 1996."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"J. Labetoulle, E. Lawler, J.K. Lenstra, A. Rinnooy Kan, \u201cPreemptive scheduling of uniform machines subject to release dates\u201d, in W.R. Pulleyblank (eds.), Progress in Combinatorial Optimization, 245\u2013261, Academic Press, 1984.","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"E. Lawler, J.K. Lenstra, A. Rinnooy Kan, and D. Shmoys, \u201cSequencing and Scheduling: Algorithms and Complexity\u201d, Logistics of Production and Inventory, Handbooks in OR & MS 4, Elsevier Science, Chapter 9, 445\u2013522, 1993.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Vincenzo Liberatore, \u201cScheduling jobs before shut-down\u201d, SWAT, 2000.","DOI":"10.1007\/3-540-44985-X_16"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 110\u2013119, El Paso, Texas, 1997.","DOI":"10.1145\/258533.258562"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram, and K. Pruhs, \u201cSpeed is as powerful as clairvoyance\u201d, IEEE Symposium on Foundations of Computation, 214\u2013221, 1995.","DOI":"10.1109\/SFCS.1995.492478"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram, and K. Pruhs. Minimizing Flow Time Nonclairvoyantly. In Proc. of IEEE Symposium on Foundations of Computer Science (FOCS\u2019 97), 1997, pages 345\u2013352.","DOI":"10.1109\/SFCS.1997.646123"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, \u201cScheduling broadcasts in wireless networks\u201d, European Symposium on Algorithms (ESA), 2000.","DOI":"10.1007\/3-540-45253-2_27"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Phillips, Stein, E. Torng, and J. Wein \u201cOptimal time-critical scheduling via resource augmentation\u201d, ACM Symposium on Theory of Computing, 140\u2013149, 1997.","DOI":"10.1145\/258533.258570"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"J. Shanmugasundaram, A. Nithrakashyap, R. Sivasankaran, and K. Ramamritham, \u201cEfficient concurrency control for broadcast environments\u201d, Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data (SIGMOD 99), pages 85\u201396, 1999.","DOI":"10.1145\/304182.304190"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann and A. Marchetti-Spaccamela. Complexity and Approximation. Springer eds., 1999.","DOI":"10.1007\/978-3-642-58412-1"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:48:23Z","timestamp":1736988503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}