{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:47:12Z","timestamp":1743155232573,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_12","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"151-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Station Assignment with Reallocation"],"prefix":"10.1007","author":[{"given":"Miguel A.","family":"Mosteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulia","family":"Rossikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24592-6_1","volume-title":"Approximation and Online Algorithms","author":"U Adamy","year":"2004","unstructured":"Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 1\u201312. Springer, Heidelberg (2004)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1290672.1290686","volume":"3","author":"S Albers","year":"2007","unstructured":"Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Trans. on Algorithms 3(4), 49 (2007)","journal-title":"ACM Trans. on Algorithms"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-33090-2_9","volume-title":"Algorithms \u2013 ESA 2012","author":"S Albers","year":"2012","unstructured":"Albers, S., Hellwig, M.: On the value of job migration in online makespan minimization. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 84\u201395. Springer, Heidelberg (2012)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms: The State of the Art","author":"Y Azar","year":"1998","unstructured":"Azar, Y.: On-line load balancing. In: Fiat, A. (ed.) Online Algorithms 1996. LNCS, vol. 1442, pp. 178\u2013195. Springer, Heidelberg (1998)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-005-1190-x","volume":"45","author":"Y Azar","year":"2006","unstructured":"Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. Algorithmica 45, 69\u201390 (2006)","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1137\/S009753970240447X","volume":"32","author":"A Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM Journal on Computing 32(4), 1091\u20131113 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1273340.1273344","volume":"3","author":"A Bar-Noy","year":"2007","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. ACM Trans. on Algorithms 3(3), 28 (2007)","journal-title":"ACM Trans. on Algorithms"},{"key":"12_CR8","unstructured":"Baruah, S., Goossens, J.: Scheduling real-time tasks: algorithms and complexity. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 15-1\u201315-41. CRC Press (2004)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Fekete, S.P., Fineman, J.T., Gilbert, S.: Reallocation problems in scheduling. In: SPAA, pp. 271\u2013279 (2013)","DOI":"10.1145\/2486159.2486181"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chan, H.-L., Chan, J.W-T., Lam, T.W., Lee, L.-K., Mak, K.-S., Wong, P.W.H.: Optimizing throughput and energy in online deadline scheduling. ACM Trans. on Algorithms 6(1) (2009)","DOI":"10.1145\/1644015.1644025"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-30551-4_24","volume-title":"Algorithms and Computation","author":"W-T Chan","year":"2004","unstructured":"Chan, W.-T., Wong, P.W.H.: On-line windows scheduling of temporary items. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 259\u2013270. Springer, Heidelberg (2004)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-07959-2_9","volume-title":"Experimental Algorithms","author":"M Farach-Colton","year":"2014","unstructured":"Farach-Colton, M., Leal, K., Mosteiro, M.A., Thraves, C.: Dynamic windows scheduling with reallocation. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 99\u2013110. Springer, Heidelberg (2014)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating 1\u20131\/e. In: FOCS, pp. 117\u2013126 (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-45346-5_12","volume-title":"Algorithms for Sensor Systems","author":"A Fern\u00e1ndez Anta","year":"2014","unstructured":"Fern\u00e1ndez Anta, A., Kowalski, D.R., Mosteiro, M.A., Wong, P.W.H.: Station assignment with applications to sensing. In: Flocchini, P., Gao, J., Kranakis, E., der Heide, F.M. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 155\u2013166. Springer, Heidelberg (2014)"},{"issue":"1\u20132","key":"12_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b-matching. Theoretical Computer Science 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/978-3-540-27836-8_92","volume-title":"Automata, Languages and Programming","author":"P Sanders","year":"2004","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1111\u20131122. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:48:53Z","timestamp":1675860533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}