{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:05:22Z","timestamp":1710248722450},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00407-3","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T19:20:13Z","timestamp":1046460013000},"page":"251-261","source":"Crossref","is-referenced-by-count":7,"title":["On-line scheduling with tight deadlines"],"prefix":"10.1016","volume":"295","author":[{"given":"Chiu-Yuen","family":"Koo","sequence":"first","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Tsuen-Wan","family":"Ngan","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Kar-Keung","family":"To","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(02)00407-3_BIB1","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/BF00365406","article-title":"On the competitiveness of on-line task real-time task scheduling","volume":"4","author":"Baruah","year":"1992","journal-title":"J. Real-Time Systems"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB2","doi-asserted-by":"crossref","unstructured":"S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, On-line scheduling in the presence of overload, in: Proc. IEEE 32nd Ann. Symp. on the Foundations of Computer Science, 1991, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1991.185354"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB3","doi-asserted-by":"crossref","unstructured":"P. Berman, C. Coulston, Speed is more powerful than clairvoyance, in: Proc. Sixth Scandinavian Workshop on Algorithm Theory, 1998, pp. 255\u2013263.","DOI":"10.1007\/BFb0054373"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB4","doi-asserted-by":"crossref","unstructured":"M. Brehob, E. Torng, P. Uthaisombut, Applying extra-resource analysis to load balancing. in: Proc. 11th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms, 2000, pp. 560\u2013561.","DOI":"10.1002\/1099-1425(200009\/10)3:5<273::AID-JOS48>3.3.CO;2-S"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB5","doi-asserted-by":"crossref","unstructured":"B. DasGupta, M.A. Palis, Online real-time preemptive scheduling of jobs with deadlines. in: Proc. Third Internat. Workshop on Approximation Algorithms for Combinatorial Optimization, 2000, pp. 96\u2013107.","DOI":"10.1007\/3-540-44436-X_11"},{"issue":"12","key":"10.1016\/S0304-3975(02)00407-3_BIB6","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/32.58762","article-title":"Multiprocessor on-line scheduling of hard-real-time tasks","volume":"15","author":"Dertouzos","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(02)00407-3_BIB7","doi-asserted-by":"crossref","unstructured":"J. Edmonds, Scheduling in the dark. in: Proc. 31st Ann. ACM Symp. on Theory of Computing, 1999, pp. 179\u2013188.","DOI":"10.1145\/301250.301299"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB8","doi-asserted-by":"crossref","unstructured":"Bala Kalyanasundaram, Kirk Pruhs, Maximizing job completions online, in: Proc. Sixth European Symp. on Algorithms, 1998, pp. 235\u2013246.","DOI":"10.1007\/3-540-68530-8_20"},{"issue":"4","key":"10.1016\/S0304-3975(02)00407-3_BIB9","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","article-title":"Speed is as powerful as clairvoyance","volume":"47","author":"Kalyanasundaram","year":"2000","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(02)00407-3_BIB10","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\/S0304-3975(02)00407-3_BIB11","unstructured":"T.W. Lam, T.W. Ngan, K.K. To, On the speed requirement for optimal deadline scheduling in overloaded systems, in: Proc. 15th Internat. Parallel and Distributed Processing Symp., 2001, pp. 2165\u20132172."},{"key":"10.1016\/S0304-3975(02)00407-3_BIB12","unstructured":"T.W. Lam, K.K. To, Trade-offs between speed and processor in hard-deadline scheduling, in: Proc. 10th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms, 1999, pp. 623\u2013632."},{"key":"10.1016\/S0304-3975(02)00407-3_BIB13","unstructured":"T.W. Lam, K.K. To, Performance guarantee for online deadline scheduling in the presence of overload, in: Proc. 12th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms, 2001, pp. 755\u2013764."},{"key":"10.1016\/S0304-3975(02)00407-3_BIB14","doi-asserted-by":"crossref","unstructured":"C.A. Phillips, C. Stein, E. Torng, J. Wein, Optimal time-critical scheduling via resource augmentation, in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 140\u2013149.","DOI":"10.1145\/258533.258570"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB15","series-title":"On-line Algorithms: The State of the Art","first-page":"196","article-title":"On-line scheduling\u2014a survey","author":"Sgall","year":"1998"},{"key":"10.1016\/S0304-3975(02)00407-3_BIB16","series-title":"Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms","author":"Stankovic","year":"1998"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T05:03:55Z","timestamp":1583989435000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397502004073"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00407-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}