{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:07:09Z","timestamp":1774620429069,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0022-0000(03)00070-9","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:48:27Z","timestamp":1057585707000},"page":"183-197","source":"Crossref","is-referenced-by-count":18,"title":["Preemptive scheduling in overloaded systems"],"prefix":"10.1016","volume":"67","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\u0131\u0301","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":"78","reference":[{"key":"10.1016\/S0022-0000(03)00070-9_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF00365406","article-title":"On the competitiveness of on-line real-time task scheduling","volume":"4","author":"Baruah","year":"1992","journal-title":"Real-Time Systems"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB2","series-title":"Online computation and competitive analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB3","doi-asserted-by":"crossref","unstructured":"Ee-Chien Chang, Chee Yap, Competitive online scheduling with level of service, in: J. Wang (Ed.), Proceedings of the Seventh Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 453\u2013462. To appear in J. of Scheduling.","DOI":"10.1007\/3-540-44679-6_51"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB4","doi-asserted-by":"crossref","unstructured":"F.Y.L. Chin, S.P.Y. Fung, On-line scheduling with partial job values: does timesharing or randomization help? (2002) Algorithmica [Manuscript], to appear.","DOI":"10.1007\/s00453-003-1025-6"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB5","first-page":"800","article-title":"Preemptive scheduling in overloaded systems","volume":"Vol. 2380","author":"Chrobak","year":"2002"},{"issue":"4","key":"10.1016\/S0022-0000(03)00070-9_BIB6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/347476.347479","article-title":"Speed is as powerful as clairvoyance","volume":"47","author":"Kalyanasundaram","year":"2000","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(03)00070-9_BIB7","series-title":"Linear Programming","author":"Karloff","year":"1991"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB8","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1022998111685","article-title":"On-line scheduling with tight deadlines","volume":"6","author":"Koo","year":"2003","journal-title":"J. of Scheduling"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB9","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/S0097539792236882","article-title":"dover","volume":"24","author":"Koren","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00070-9_BIB10","unstructured":"Tak-Wah Lam, Tsuen-Wan Ngan, Ker-Keung To, On the speed requirement for optimal deadline scheduling in overloaded systems, in: Proceedings of the 15th International Parallel and Distributed Processing Symposium, IEEE, San Francisco, CA, 2001, p. 202."},{"key":"10.1016\/S0022-0000(03)00070-9_BIB11","unstructured":"Tak-Wah Lam, Ker-Keung To, Trade-offs between speed and processor in hard-deadline scheduling, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, ACM\/SIAM, 1999, pp. 755\u2013764."},{"key":"10.1016\/S0022-0000(03)00070-9_BIB12","series-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"Roos","year":"1997"},{"key":"10.1016\/S0022-0000(03)00070-9_BIB13","first-page":"196","article-title":"Online scheduling","volume":"Vol. 1442","author":"Sgall","year":"1998"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000709?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000709?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T17:04:50Z","timestamp":1585069490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0022000003000709"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00070-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}