{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:28Z","timestamp":1725493648808},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_43","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"425-434","source":"Crossref","is-referenced-by-count":6,"title":["Improved Competitive Algorithms for Online Scheduling with Partial Job Values"],"prefix":"10.1007","author":[{"given":"Francis Y. L.","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley P. Y.","family":"Fung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00365406","volume":"4","author":"S. Baruah","year":"1992","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, Real-Time Systems 4, 125\u2013144, 1992.","journal-title":"Real-Time Systems"},{"key":"43_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, New York, 1998."},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"E. Chang and C. Yap, Competitive Online Scheduling with Level of Service, Proceedings of 7th Annual International Computing and Combinatorics Conference, 453\u2013462, 2001.","DOI":"10.1007\/3-540-44679-6_51"},{"key":"43_CR4","unstructured":"F. Y. L. Chin and S. P. Y. Fung, Online Scheduling with Partial Job Values and Bounded Importance Ratio, Proceedings of International Computer Symposium, 787\u2013794, 2002."},{"key":"43_CR5","unstructured":"F. Y. L. Chin and S. P. Y. Fung, Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? to appear in Algorithmica."},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tich\u00fd and N. Vakhania, Preemptive Scheduling in Overloaded Systems, preliminary version appeared in Proceedings of 29th International Colloqium on Automata, Languages and Programming, 800\u2013811, 2002.","DOI":"10.1007\/3-540-45465-9_68"},{"issue":"4","key":"43_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasunaram","year":"2000","unstructured":"B. Kalyanasunaram and K. Pruhs, Speed is as Powerful as Clairvoyance, Journal of the ACM 47(4), 617\u2013643, 2000.","journal-title":"Journal of the ACM"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"C.-Y. Koo, T.-W. Lam, T.-W. Ngan and K.-K. To, Extra Processors versus Future Information in Optimal Deadline Scheduling, Proceedings of 15th ACM Symposium on Parallelism in Algorithms and Architectures, 133\u2013142, 2002.","DOI":"10.1145\/564870.564890"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/S0097539792236882","volume":"24","author":"G. Koren","year":"1995","unstructured":"G. Koren and D. Shasha, D over : An Optimal On-line Scheduling Algorithm for Overloaded Uniprocessor Real-time Systems, SIAM Journal on Computing 24, 318\u2013339, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"43_CR10","unstructured":"T.-W. Lam and K.-K. To, Performance Guarantee for Online Deadline Scheduling in the Presence of Overload, Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 755\u2013764, 2001."},{"issue":"5","key":"43_CR11","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/2.76287","volume":"24","author":"J. W. S. Liu","year":"1991","unstructured":"J. W. S. Liu, K.-J. Lin, W.-K. Shih, A. C.-S. Yu, J.-Y. Chung and W. Zhao, Algorithms for Scheduling Imprecise Computations, IEEE Computer 24(5), 58\u201368, 1991.","journal-title":"IEEE Computer"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"C. A. Philips, C. Stein, E. Torng and J. Wein, Optimal Time-critical Scheduling via Resource Augmentation, Proceedings of 29th Annual ACM Symposium on Theory of Computing, 140\u2013149, 1997.","DOI":"10.1145\/258533.258570"},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan, Amortized Efficiency of List Update and Paging Rules, Communications of the ACM 28(2), 202\u2013208, 1985.","journal-title":"Communications of the ACM"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao, Probabilistic Computations: Toward a Unified Measure of Complexity, Proceedings of 18th IEEE Symposium on Foundations of Computer Science, 222\u2013227, 1977.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:09:05Z","timestamp":1556921345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}