{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:19:02Z","timestamp":1773807542542,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00288-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:42:39Z","timestamp":1027629759000},"page":"437-458","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":80,"title":["Preemptive multiprocessor scheduling with rejection"],"prefix":"10.1016","volume":"262","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(00)00288-7_BIB1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","article-title":"Better bounds for online scheduling","volume":"29","author":"Albers","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(00)00288-7_BIB2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","article-title":"New algorithms for an ancient scheduling problem","volume":"51","author":"Bartal","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(00)00288-7_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","article-title":"A better lower bound for on-line scheduling","volume":"50","author":"Bartal","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0304-3975(00)00288-7_BIB4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","article-title":"Multiprocessor scheduling with rejection","volume":"13","author":"Bartal","year":"2000","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"10.1016\/S0304-3975(00)00288-7_BIB5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","article-title":"A lower bound for randomized on-line scheduling algorithms","volume":"51","author":"Chen","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(00)00288-7_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","article-title":"New lower and upper bounds for on-line scheduling","volume":"16","author":"Chen","year":"1994","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/S0304-3975(00)00288-7_BIB7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(95)00039-9","article-title":"An optimal algorithm for preemptive on-line scheduling","volume":"18","author":"Chen","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(00)00288-7_BIB8","doi-asserted-by":"crossref","unstructured":"D. Engels, D. Karger, S. Kolliopoulos, S. Sengupta, R. Uma, J. Wein, Techniques for scheduling with rejection, Proc. 6th European Symp. on Algorithms, August 1998, pp. 490\u2013501.","DOI":"10.1007\/3-540-68530-8_41"},{"issue":"2","key":"10.1016\/S0304-3975(00)00288-7_BIB9","first-page":"107","article-title":"On the performance of on-line algorithms for partition problems","volume":"9","author":"Faigle","year":"1989","journal-title":"Acta Cybernet."},{"issue":"2","key":"10.1016\/S0304-3975(00)00288-7_BIB10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","article-title":"An online scheduling heuristic with better worst case ratio than Graham's list scheduling","volume":"22","author":"Galambos","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(00)00288-7_BIB11","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","article-title":"A better algorithm for an ancient scheduling problem","volume":"20","author":"Karger","year":"1996","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0304-3975(00)00288-7_BIB12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00288-7_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/S0304-3975(00)00288-7_BIB14","doi-asserted-by":"crossref","unstructured":"S.S. Seiden, Randomized algorithms for that ancient scheduling problem, Proc. 5th Workshop on Algorithms and Data Structures, August 1997, pp. 210\u2013223.","DOI":"10.1007\/3-540-63307-3_61"},{"issue":"1","key":"10.1016\/S0304-3975(00)00288-7_BIB15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","article-title":"A lower bound for randomized on-line multiprocessor scheduling","volume":"63","author":"Sgall","year":"1997","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(00)00288-7_BIB16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002887?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002887?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:38Z","timestamp":1759625558000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002887"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00288-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Preemptive multiprocessor scheduling with rejection","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00288-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}