{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:10:04Z","timestamp":1751634604400,"version":"3.41.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1023\/a:1022904408360","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"251-267","source":"Crossref","is-referenced-by-count":8,"title":["Competitive On-Line Scheduling with Level of Service"],"prefix":"10.1007","volume":"6","author":[{"given":"Ee-Chien","family":"Chang","sequence":"first","affiliation":[]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5117215_CR1","unstructured":"Albers, S., \u201cCompetitive online algorithms,\u201d BRICS Lecture Series LS-96-2, BRICS, Department of Computer Science, University of Aarhus, September 1996."},{"key":"5117215_CR2","unstructured":"Albers, S. and J. Westbrook, \u201cA survey of self-organizing data structures,\u201d Research Report MPI-I-96-1-026, Max-Planck-Institut f\u00fcr InformatikIm Stadtwald, D-66123, Saarbr\u00fccken, Germany, October 1996."},{"key":"5117215_CR3","unstructured":"Arkin, E., Private communication (1997)."},{"key":"5117215_CR4","unstructured":"Chang, E.-C., C. Yap, and T.-J. Yen, \u201cRealtime visualization of large images over a thinwire,\u201d in IEEE Visualization '97 (Late Breaking Hot Topics), 1997, pp. 45-48. See CD proceedings of conference. Paper from ftp:\/\/cs.nyu.edu\/pub\/local\/yap\/visual\/thinwire.ps.gz."},{"key":"5117215_CR5","unstructured":"Chang, E.-C., Foveation Techniques and Scheduling Issues in Thinwire Visualization, Ph.D thesis Department of Computer Science, New York University, May 1998."},{"key":"5117215_CR6","doi-asserted-by":"crossref","unstructured":"Hoogeveen, J. A. and A. P. A. Vestjens, \u201cOptimal on-line algorithms for single-machine scheduling,\u201d Integer Programming and Combinatorial Optimization, 1996, pp. 404-414.","DOI":"10.1007\/3-540-61310-2_30"},{"key":"5117215_CR7","unstructured":"Lipton, R. J. and A. Tomkins, \u201cOnline interval scheduling,\u201d in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms., 1994, pp. 302-311."},{"key":"5117215_CR8","doi-asserted-by":"crossref","unstructured":"Manasse, M., L. A. McGeoch, and D. Sleator, \u201cCompetitive algorithms for server problems,\u201d in Proc. 20th Ann. ACM Symp. on Theory of Computing, 1988, pp. 322-333.","DOI":"10.1145\/62212.62243"},{"key":"5117215_CR9","doi-asserted-by":"crossref","unstructured":"McGeoch, L.A. and D.D. Sleator (eds.), On-Line Algorithms, DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 7. American Mathematical Society, 1992.","DOI":"10.1090\/dimacs\/007"},{"issue":"2","key":"5117215_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D. and R. Tarjan, \u201cAmortized efficiency of list update and paging rules,\u201d Comm. ACM, 28(2), 202-208 (1985).","journal-title":"Comm. ACM"},{"key":"5117215_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J., \u201cOn-line scheduling of jobs with fixed start and end times,\u201d Theor. Comput. Sci., 130, 5-16 (1994).","journal-title":"Theor. Comput. Sci."},{"key":"5117215_CR12","unstructured":"Yao, F., A. Demers, and S. Shenker, \u201cA scheduling model for reduced CPU energy,\u201d in Proc. 36th Ann. Symp. on Foundations Comput. Sci., 1995, pp. 374-382."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022904408360.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022904408360\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022904408360.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:50:58Z","timestamp":1751633458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022904408360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["5117215"],"URL":"https:\/\/doi.org\/10.1023\/a:1022904408360","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}