{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:21Z","timestamp":1751634261905},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_68","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"800-811","source":"Crossref","is-referenced-by-count":13,"title":["Preemptive Scheduling in Overloaded Systems"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Tich\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nodari","family":"Vakhania","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00365406","volume":"4","author":"S. Baruah","year":"1992","unstructured":"Sanjoy Baruah, Gilad Koren, Decao Mao, Bud Mishra, Arvind Raghunathan, Louis Rosier, Dennis Shasha, and Fuxing Wang. On the competitiveness of on-line realtime task scheduling. Real-Time Systems, 4:125\u2013144, 1992.","journal-title":"Real-Time Systems"},{"key":"68_CR2","unstructured":"Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"68_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/3-540-44679-6_51","volume-title":"Proc. 7th Annual International Computing and Combinatorics Conference","author":"E.-C. Chang","year":"2001","unstructured":"Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453\u2013462. Springer, 2001."},{"issue":"4","key":"68_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):214\u2013221, 2000.","journal-title":"Journal of the ACM"},{"key":"68_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/3-540-44683-4_41","volume-title":"Proc. 26th Symp. on Mathematical Foundations of Computer Science","author":"C.-Y. Koo","year":"2001","unstructured":"Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, and Kar-Keung To. On-line scheduling with tight deadlines. In Proc. 26th Symp. on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 464\u2013473, 2001."},{"key":"68_CR6","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":"68_CR7","unstructured":"Tak-Wah Lam, Tsuen-Wan Ngan, and Ker-Keung To. On the speed requirement for optimal deadline scheduling in overloaded systems. In Proc. 15th International Parallel and Distributed Processing Symposium, page 202, 2001."},{"key":"68_CR8","unstructured":"Tak-Wah Lam and Ker-Keung To. Trade-offs between speed and processor in hard-deadline scheduling. In Proc. 10th Symp. on Discrete Algorithms, pages 755\u2013764, 1999."},{"key":"68_CR9","doi-asserted-by":"crossref","unstructured":"Ji\u0159\u00ed Sgall. Online scheduling. In Online Algorithms: The State of Art, pages 196\u2013227. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0029570"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:06:22Z","timestamp":1556449582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_68","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}