{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:08:11Z","timestamp":1787501291795,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633075","type":"print"},{"value":"9783540694229","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_65","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T15:22:48Z","timestamp":1270480968000},"page":"258-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On-line scheduling with hard deadlines"],"prefix":"10.1007","author":[{"given":"Sally A.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jyoti","family":"Parwatikar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive on-line routing. In Proc. of the 34th Ann. Symp. on Foundations of Comp. Sci., pp. 32\u201341. IEEE, Computer Society Press, Los Alamitos, CA, 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"23_CR2","unstructured":"B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown durations. In Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs., pp. 321\u2013327. SIAM, San Fransico, CA, 1994."},{"key":"23_CR3","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, and A. R\u00f3sen. Competitive non-preemptive call control. In Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs., pp. 312\u2013320. SIAM, San Fransico, CA, 1994."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proc. of the 35th Ann. Symp. on Foundations of Comp. Sci., pp. 412\u2013423. IEEE, Computer Society Press, Los Alamitos, CA, 1994.","DOI":"10.1109\/SFCS.1994.365675"},{"issue":"1","key":"23_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2\u201314, 1994.","journal-title":"Algorithmica"},{"issue":"4","key":"23_CR6","first-page":"745","volume":"39","author":"A. Borodin","year":"1992","unstructured":"A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. Communications of the ACM, 39(4):745\u2013763, 1992.","journal-title":"Communications of the ACM"},{"key":"23_CR7","series-title":"Technical Report CMU-CS-95-102","volume-title":"Competitive analysis of call admission algorithms that allow delay","author":"A. Feldmann","year":"1995","unstructured":"A. Feldmann, B. Maggs, J. Sgall, D. Sleator, and A. Tomkins. Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS-95-102, School of Computer Science, CMU, Pittsburgh, PA 15213, 1995."},{"key":"23_CR8","first-page":"1043","volume-title":"Proc. of INFOCOM '92","author":"J. Garay","year":"1992","unstructured":"J. Garay and I. Gopal. Call preemption in communication networks. In Proc. of INFOCOM '92, pp. 1043\u20131050. IEEE, Computer Society Press, Los Alamitos, CA, 1992."},{"key":"23_CR9","first-page":"285","volume-title":"Proc. of the 2nd Israel Symp. on Theory and Computing Systems","author":"J. Garay","year":"1993","unstructured":"J. Garay, I. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. In Proc. of the 2nd Israel Symp. on Theory and Computing Systems, pp. 285\u2013293. IEEE, Computer Society Press, Los Alamitos, CA, 1993."},{"issue":"1","key":"23_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudolpoh, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"23_CR11","first-page":"302","volume-title":"Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs.","author":"R. Lipton","year":"1994","unstructured":"R. Lipton and A. Tomkins. Online interval scheduling. In Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs., pp. 302\u2013311. SIAM, San Fransico, CA, 1994."},{"issue":"2","key":"23_CR12","doi-asserted-by":"crossref","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T16:14:47Z","timestamp":1739981687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_65"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"30 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}