{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T21:03:40Z","timestamp":1762808620334,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T00:00:00Z","timestamp":1527638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"U. of Liverpool Departmental Visiting Fellowship"},{"name":"U. of Liverpool Network Sciences & Technologies"},{"name":"Pace University","award":["NYFC SRC","Kenan Fund Award"],"award-info":[{"award-number":["NYFC SRC","Kenan Fund Award"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00453-018-0459-9","type":"journal-article","created":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T13:46:13Z","timestamp":1527687973000},"page":"1096-1125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Station Assignment with Reallocation"],"prefix":"10.1007","volume":"81","author":[{"given":"Austin","family":"Halper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5842-6256","authenticated-orcid":false,"given":"Miguel A.","family":"Mosteiro","sequence":"additional","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":[[2018,5,30]]},"reference":[{"key":"459_CR1","doi-asserted-by":"crossref","unstructured":"Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Proceedings of the 1st International Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, vol. 2909, pp. 1\u201312. Springer (2003)","DOI":"10.1007\/978-3-540-24592-6_1"},{"issue":"4","key":"459_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. Algorithms 3(4), 49 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"459_CR3","doi-asserted-by":"crossref","unstructured":"Albers, S., Hellwig, M.: On the value of job migration in online makespan minimization. In: Proceedings of the 20th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 7501, pp. 84\u201395. Springer (2012)","DOI":"10.1007\/978-3-642-33090-2_9"},{"key":"459_CR4","doi-asserted-by":"crossref","unstructured":"Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (DIS)economies of scale. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 585\u2013592. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.61"},{"key":"459_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y.: On-line load balancing. In: Proceedings of Developments from a June 1996 Seminar on Online Algorithms: The State of the Art, pp. 178\u2013195. Springer (1996)","DOI":"10.1007\/BFb0029569"},{"key":"459_CR6","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"},{"key":"459_CR7","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. In: Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA), pp. 25\u201336 (2010)","DOI":"10.1007\/978-3-642-18318-8_3"},{"issue":"2","key":"459_CR8","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2438645.2438650","volume":"9","author":"N Bansal","year":"2013","unstructured":"Bansal, N., Chan, H.L., Pruhs, K.: Speed scaling with an arbitrary power function. ACM Trans. Algorithms 9(2), 18:1\u201318:14 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"459_CR9","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11\u201320 (1998)"},{"issue":"4","key":"459_CR10","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 J. Comput. 32(4), 1091\u20131113 (2003)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"459_CR11","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. Algorithms 3(3), 28 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"459_CR12","first-page":"15-1","volume-title":"Handbook of Scheduling: Algorithms","author":"S Baruah","year":"2004","unstructured":"Baruah, S., Goossens, J.: Scheduling real-time tasks: Algorithms and complexity. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, pp. 15-1\u201315-41. Models and Performance Analysis. CRC Press, Boca Raton (2004)"},{"issue":"1","key":"459_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/net.20045","volume":"45","author":"L Becchetti","year":"2005","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A., Diggavi, S., Muthukrishnan, S., Nandagopal, T.: Parallel scheduling problems in next generation wireless networks. Networks 45(1), 9\u201322 (2005)","journal-title":"Networks"},{"key":"459_CR14","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Fekete, S.P., Fineman, J.T., Gilbert, S.: Reallocation problems in scheduling. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 271\u2013279. ACM (2013)","DOI":"10.1145\/2486159.2486181"},{"issue":"1","key":"459_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644015.1644025","volume":"6","author":"H Chan","year":"2009","unstructured":"Chan, H., Chan, J.W., Lam, T.W., Lee, L., Mak, K., Wong, P.W.H.: Optimizing throughput and energy in online deadline scheduling. ACM Trans. Algorithms 6(1), 1\u201322 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"459_CR16","doi-asserted-by":"crossref","unstructured":"Chan, W.T., Wong, P.: On-line windows scheduling of temporary items. In: Proceedings of the 15th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 3341, pp. 259\u2013270. Springer (2004)","DOI":"10.1007\/978-3-540-30551-4_24"},{"key":"459_CR17","doi-asserted-by":"crossref","unstructured":"Coffman\u00a0Jr, E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer (2013)","DOI":"10.1007\/978-1-4419-7997-1_35"},{"key":"459_CR18","first-page":"151","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman Jr","year":"1998","unstructured":"Coffman Jr., E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 151\u2013207. Kluwer Academic Publishers, Norwell (1998)"},{"key":"459_CR19","unstructured":"Coffman, Jr., E.G., Garey, M.R., Johnson, D.S.: Bin packing approximation algorithms: a survey. In: D.S. Hochbaum (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS (1996)"},{"key":"459_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.comnet.2017.04.008","volume":"121","author":"L Cominardi","year":"2017","unstructured":"Cominardi, L., Giust, F., Bernardos, C.J., de la Oliva, A.: Distributed mobility management solutions for next mobile network architectures. Comput. Netw. 121, 124\u2013136 (2017)","journal-title":"Comput. Netw."},{"issue":"4","key":"459_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-008-9188-9","volume":"56","author":"L Epstein","year":"2010","unstructured":"Epstein, L.: Bin packing with rejection revisited. Algorithmica 56(4), 505\u2013528 (2010)","journal-title":"Algorithmica"},{"issue":"3","key":"459_CR22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00453-007-9071-0","volume":"53","author":"L Epstein","year":"2009","unstructured":"Epstein, L., Erlebach, T., Levin, A.: Variable sized online interval coloring with bandwidth. Algorithmica 53(3), 385\u2013401 (2009)","journal-title":"Algorithmica"},{"key":"459_CR23","doi-asserted-by":"crossref","unstructured":"Farach-Colton, M., Leal, K., Mosteiro, M.A., Thraves, C.: Dynamic windows scheduling with reallocation. In: Proceedings of the 13th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science, vol. 8504, pp. 99\u2013110. Springer (2014)","DOI":"10.1007\/978-3-319-07959-2_9"},{"key":"459_CR24","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1\/e. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117 \u2013126. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"459_CR25","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Kowalski, D.R., Mosteiro, M.A., Wong, P.W.H.: Station assignment with applications to sensing. In: Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Lecture Notes in Computer Science, vol. 8243, pp. 155\u2013169. Springer (2013)","DOI":"10.1007\/978-3-642-45346-5_12"},{"key":"459_CR26","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Pruhs, K.: Online primal-dual for non-linear optimization with applications to speed scaling. In: Proceedings of the 10th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, vol. 7846, pp. 173\u2013186. Springer (2012)","DOI":"10.1007\/978-3-642-38016-7_15"},{"key":"459_CR27","unstructured":"Halper, A., Mosteiro, M.A., Rossikova, Y., Wong, P.W.H.: Station assignment with reallocation simulator code and data. http:\/\/csis.pace.edu\/~mmosteiro\/pub\/sourceBSreallocJournal\/ (2017). Accessed 27 May 2018"},{"key":"459_CR28","doi-asserted-by":"crossref","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: Proceedings of the 22nd Annual Hawaii International Conference on System Sciences, vol. II, Software Track, pp. 693\u2013702 (1989)","DOI":"10.1109\/HICSS.1989.48075"},{"key":"459_CR29","unstructured":"Jacobs, T., Longo, S.: A new perspective on the windows scheduling problem (2014). arXiv:1410.7237"},{"issue":"3","key":"459_CR30","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/TNET.2014.2313120","volume":"23","author":"B Ji","year":"2015","unstructured":"Ji, B., Gupta, G.R., Sharma, M., Lin, X., Shroff, N.B.: Achieving optimal throughput and near-optimal asymptotic delay performance in multi-channel wireless networks with low complexity: a practical greedy scheduling policy. IEEE\/ACM Trans. Netw. 23(3), 880\u2013893 (2015)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1\u20132","key":"459_CR31","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. Theor. Comput. Sci. 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"459_CR32","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00779-007-0180-1","volume":"12","author":"E Kanjo","year":"2008","unstructured":"Kanjo, E., Benford, S., Paxton, M., Chamberlain, A., Fraser, D.S., Woodgate, D., Crellin, D., Woolard, A.: Mobgeosen: facilitating personal geosensor data collection and visualization using mobile phones. Pers. Ubiquit. Comput. 12(8), 599\u2013607 (2008)","journal-title":"Pers. Ubiquit. Comput."},{"issue":"1","key":"459_CR33","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/SURV.2012.031412.00077","volume":"15","author":"WZ Khan","year":"2013","unstructured":"Khan, W.Z., Xiang, Y., Aalsalem, M.Y., Arshad, Q.: Mobile phone sensing systems: a survey. IEEE Commun. Surv. Tutor. 15(1), 402\u2013427 (2013)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"459_CR34","doi-asserted-by":"crossref","unstructured":"Mosteiro, M.A., Rossikova, Y., Wong, P.W.: Station assignment with reallocation. In: Proceedings of the 14th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science, pp. 151\u2013164. Springer (2015)","DOI":"10.1007\/978-3-319-20086-6_12"},{"issue":"2","key":"459_CR35","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2888398","volume":"12","author":"F Restuccia","year":"2016","unstructured":"Restuccia, F., Das, S.K., Payton, J.: Incentive mechanisms for participatory sensing: survey and research challenges. TOSN 12(2), 13:1\u201313:40 (2016)","journal-title":"TOSN"},{"key":"459_CR36","doi-asserted-by":"crossref","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 3142, pp. 1111\u20131122. Springer (2004)","DOI":"10.1007\/978-3-540-27836-8_92"},{"issue":"2","key":"459_CR37","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1287\/moor.1090.0381","volume":"34","author":"P Sanders","year":"2009","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Math. Oper. Res. 34(2), 481\u2013498 (2009)","journal-title":"Math. Oper. Res."},{"key":"459_CR38","doi-asserted-by":"crossref","unstructured":"Sha, K., Zhan, G., Shi, W., Lumley, M., Wiholm, C., Arnetz, B.: Spa: a smart phone assisted chronic illness self-management system with participatory sensing. In: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments, HealthNet \u201908, pp. 5:1\u20135:3. ACM, New York, NY, USA (2008)","DOI":"10.1145\/1515747.1515755"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0459-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0459-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0459-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T05:00:18Z","timestamp":1720328418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0459-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,30]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0459-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,5,30]]},"assertion":[{"value":"3 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}