{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:24:00Z","timestamp":1743135840997,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086229"},{"type":"electronic","value":"9783031086236"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_20","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"127-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Heuristic-Based Reduction for\u00a0the\u00a0Temporal Bin Packing Problem with\u00a0Fire-Ups"],"prefix":"10.1007","author":[{"given":"John","family":"Martinovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Strasdat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.3390\/challe6010117","volume":"6","author":"ASG Andrae","year":"2015","unstructured":"Andrae, A.S.G., Edler, T.: On global electricity usage of communication technology: trends to 2030. Challenges 6(1), 117\u2013157 (2015)","journal-title":"Challenges"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"104959","DOI":"10.1016\/j.cor.2020.104959","volume":"121","author":"N Aydin","year":"2020","unstructured":"Aydin, N., Muter, I., Ilker Birbil, S.: Multi-objective temporal bin packing problem: an application in cloud computing. Comput. Oper. Res. 121, 104959 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1287\/ijoc.1120.0521","volume":"25","author":"A Caprara","year":"2013","unstructured":"Caprara, A., Furini, F., Malaguti, E.: Uncommon Dantzig-Wolfe reformulation for the temporal Knapsack problem. INFORMS J. Comput. 25(3), 560\u2013571 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2020.12.036","volume":"293","author":"F Clautiaux","year":"2021","unstructured":"Clautiaux, F., Detienne, B., Guillot, G.: An iterative dynamic programming approach for the temporal Knapsack problem. Eur. J. Oper. Res. 293(2), 442\u2013456 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"de Cauwer, M., Mehta, D., O\u2019Sullivan, B.: The temporal bin packing problem: an application to workload management in data centres. In: Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, pp. 157\u2013164 (2016)","DOI":"10.1109\/ICTAI.2016.0033"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"104825","DOI":"10.1016\/j.cor.2019.104825","volume":"114","author":"M Dell\u2019Amico","year":"2020","unstructured":"Dell\u2019Amico, M., Furini, F., Iori, M.: A branch-and-price algorithm for the temporal bin packing problem. Comput. Oper. Res. 114, 104825 (2020)","journal-title":"Comput. Oper. Res."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1038\/d41586-018-06610-y","volume":"561","author":"N Jones","year":"2018","unstructured":"Jones, N.: How to stop data centres from gobbling up the world\u2019s electricity. Nature 561, 163\u2013166 (2018)","journal-title":"Nature"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"105288","DOI":"10.1016\/j.cor.2021.105288","volume":"132","author":"J Martinovic","year":"2021","unstructured":"Martinovic, J., Strasdat, N., Selch, M.: Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. Comput. Oper. Res. 132, 105288 (2021)","journal-title":"Comput. Oper. Res."},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Martinovic, J., Strasdat, N., Val\u00e9rio de Carvalho, J., Furini, F.: Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim. Lett. (2021). https:\/\/doi.org\/10.1007\/s11590-021-01825-x","DOI":"10.1007\/s11590-021-01825-x"},{"key":"20_CR11","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64403-5","volume-title":"Introduction to Cutting and Packing Optimization - Problems, Modeling Approaches, Solution Methods","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer, G.: Introduction to Cutting and Packing Optimization - Problems, Modeling Approaches, Solution Methods. International Series in Operations Research & Management Science, vol. 263. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-64403-5"}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:07:51Z","timestamp":1661756871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_20","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}