{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:36:18Z","timestamp":1725795378037},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_9","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"99-110","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic Windows Scheduling with Reallocation\u00a0"],"prefix":"10.1007","author":[{"given":"Mart\u00edn","family":"Farach-Colton","sequence":"first","affiliation":[]},{"given":"Katia","family":"Leal","sequence":"additional","affiliation":[]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Thraves","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J.: Semi-on-line bin packing: A short overview and a new lower bound. Central European Journal of Operations Research, 1\u201314 (2012)","DOI":"10.1007\/s10100-012-0266-3"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G., Reinelt, G.: On-line bin packing with restricted repacking. Journal of Combinatorial Optimization, 1\u201317 (2012)","DOI":"10.1007\/s10878-012-9489-4"},{"key":"9_CR3","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":"9_CR4","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\u00a032(4), 1091\u20131113 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"9_CR5","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 Transactions on Algorithms (TALG)\u00a03(3), 28 (2007)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Fekete, S.P., Fineman, J.T., Gilbert, S.: Reallocation problems in scheduling. In: 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 271\u2013279 (2013)","DOI":"10.1145\/2486159.2486181"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.tcs.2008.09.028","volume":"409","author":"J.W.-T. Chan","year":"2008","unstructured":"Chan, J.W.-T., Lam, T.-W., Wong, P.W.H.: Dynamic bin packing of unit fractions items. Theoretical Computer Science\u00a0409(3), 521\u2013529 (2008)","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","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.\u00a03341, pp. 259\u2013270. Springer, Heidelberg (2004)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"M. Farach-Colton, K. Leal, M.A. Mosteiro, C. Thraves. Dynamic windows scheduling with reallocation. arXiv:1404.1087 (April 2014)","DOI":"10.1007\/978-3-319-07959-2_9"},{"issue":"23","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.ipl.2010.09.002","volume":"110","author":"X. Han","year":"2010","unstructured":"Han, X., Peng, C., Ye, D., Zhang, D., Lan, Y.: Dynamic bin packing with unit fraction items revisited. Information Processing Letters\u00a0110(23), 1049\u20131054 (2010)","journal-title":"Information Processing Letters"},{"issue":"1-4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00170-009-2190-9","volume":"47","author":"M. Heydari","year":"2010","unstructured":"Heydari, M., Sadjadi, S.J., Mohammadi, E.: Minimizing total flow time subject to preemption penalties in online scheduling. The International Journal of Advanced Manufacturing Technology\u00a047(1-4), 227\u2013236 (2010)","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1137\/S0097539794276749","volume":"28","author":"Z. Ivkovic","year":"1998","unstructured":"Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM Journal on Computing\u00a028(2), 574\u2013611 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/B:JOSH.0000031424.35504.c4","volume":"7","author":"Z. Liu","year":"2004","unstructured":"Liu, Z., Edwin Cheng, T.C.: Minimizing total completion time subject to job release dates and preemption penalties. Journal of Scheduling\u00a07(4), 313\u2013327 (2004)","journal-title":"Journal of Scheduling"},{"key":"9_CR14","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.\u00a03142, pp. 1111\u20131122. Springer, Heidelberg (2004)"},{"issue":"3-4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00453-005-1171-0","volume":"42","author":"H. Shachnai","year":"2005","unstructured":"Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing makespan and preemption costs on a system of uniform machines. Algorithmica\u00a042(3-4), 309\u2013334 (2005)","journal-title":"Algorithmica"},{"key":"9_CR16","unstructured":"SimJava (2006), \n                    \n                      http:\/\/www.icsa.inf.ed.ac.uk\/research\/groups\/hase\/simjava\/"},{"issue":"1","key":"9_CR17","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. Journal of Algorithms\u00a035(1), 1\u201316 (2000)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"9_CR18","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2012.12.011","volume":"113","author":"H. Yu","year":"2013","unstructured":"Yu, H., Xu, Y., Wu, T.: Online inventory replenishment scheduling of temporary orders. Information Processing Letters\u00a0113(5), 188\u2013192 (2013)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:40:00Z","timestamp":1558906800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}