{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T08:21:51Z","timestamp":1791015711573,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_92","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"1111-1122","source":"Crossref","is-referenced-by-count":14,"title":["Online Scheduling with Bounded Migration"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naveen","family":"Sivadasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"92_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S. Albers","year":"1999","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing\u00a029, 459\u2013473 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"92_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: a survey. Mathematical Programming\u00a097, 3\u201326 (2003)","journal-title":"Mathematical Programming"},{"key":"92_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/PL00009263","volume":"23","author":"M. Andrews","year":"1999","unstructured":"Andrews, M., Goemans, M.X., Zhang, L.: Improved bounds for on-line load balancing. Algorithmica\u00a023, 278\u2013301 (1999)","journal-title":"Algorithmica"},{"key":"92_CR4","first-page":"67","volume":"1","author":"Y. Azar","year":"1998","unstructured":"Azar, Y., Epstein, L.: On-line machine covering. Journal of Algorithms\u00a01, 67\u201377 (1998)","journal-title":"Journal of Algorithms"},{"key":"92_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences\u00a051, 359\u2013366 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"92_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B. Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Information Processing Letters\u00a051, 219\u2013222 (1994)","journal-title":"Information Processing Letters"},{"key":"92_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling\u00a03, 343\u2013353 (2000)","journal-title":"Journal of Scheduling"},{"key":"92_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Strong np-completeness results: Motivation, examples and implications. Journal of the ACM\u00a025, 499\u2013508 (1978)","journal-title":"Journal of the ACM"},{"key":"92_CR9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"92_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"92_CR11","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. Journal of Algorithms\u00a020, 400\u2013430 (1996)","journal-title":"Journal of Algorithms"},{"key":"92_CR12","unstructured":"Rudin III., J.F.: Improved bounds for the on-line scheduling problem. PhD thesis, The University of Texas at Dallas (2001)"},{"key":"92_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-24618-3_8","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"P. Sanders","year":"2004","unstructured":"Sanders, P.: Algorithms for scalable storage servers. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 82\u2013101. Springer, Heidelberg (2004)"},{"key":"92_CR14","doi-asserted-by":"crossref","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Research Report MPI-I-2004-1-004, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (April 2004)","DOI":"10.1007\/978-3-540-27836-8_92"},{"key":"92_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)"},{"issue":"1","key":"92_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","volume":"63","author":"J. Sgall","year":"1997","unstructured":"Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters\u00a063(1), 51\u201355 (1997)","journal-title":"Information Processing Letters"},{"key":"92_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms","author":"J. Sgall","year":"1998","unstructured":"Sgall, J.: On-line scheduling \u2014 a survey. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 196\u2013231. Springer, Heidelberg (1998)"},{"issue":"1","key":"92_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2000.1074","volume":"35","author":"J. Westbrook","year":"2000","unstructured":"Westbrook, J.: Load balancing for response time. J. Algorithms\u00a035(1), 1\u201316 (2000)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T20:30:33Z","timestamp":1636489833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}