{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:42Z","timestamp":1759132002254,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_6","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"42-50","source":"Crossref","is-referenced-by-count":3,"title":["Maximizing Job Benefits On-Line"],"prefix":"10.1007","author":[{"given":"Baruch","family":"Awerbuch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossi","family":"Azar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Regev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing (STOC), 1999.","DOI":"10.1145\/301250.301304"},{"key":"6_CR2","unstructured":"K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. In IEEE Real-Time Systems Symposium, pages 106\u2013115, 1991.","DOI":"10.1109\/REAL.1991.160364"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha. Online scheduling in the presence of overload. In 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 100\u2013110, San Juan, Puerto Rico, 1991.","DOI":"10.1109\/SFCS.1991.185354"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","volume":"75","author":"J. Du","year":"1990","unstructured":"J. Du, J. Y. T. Leung, and G. H. Young. Minimizing mean flow time with release time constraint. Theoretical Computer Science, 75(3):347\u2013355, 1990.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","unstructured":"B. Kalyanasundaram and K. Pruhs. Real-time scheduling with fault-tolerance. Technical report, Computer Science Dept. University of Pittsburgh."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"G. Koren and D. Shasha. Dover: An optimal on-line scheduling algorithm for overloaded real-time systems. IEEE Real-time Systems Symposium, pages 290\u2013299, 1992.","DOI":"10.1109\/REAL.1992.242650"},{"issue":"1-2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0304-3975(94)90165-1","volume":"128","author":"G. Koren","year":"1994","unstructured":"G. Koren and D. Shasha. MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science, 128(1-2):75\u201397, 1994.","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","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"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T08:32:07Z","timestamp":1737102727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}