A Heuristic-Based Reduction for the Temporal Bin Packing Problem with Fire-Ups

John Martinovic () and Nico Strasdat ()
Additional contact information
John Martinovic: Technische Universität Dresden
Nico Strasdat: Technische Universität Dresden

A chapter in Operations Research Proceedings 2021, 2022, pp 127-133 from Springer

Abstract: Abstract Given the ever-increasing role of data centers in global energy consumption, the problem of assigning jobs (items) to servers (bins) in an energy-efficient manner has become more and more important in recent years. In that respect, the temporal bin packing problem with fire-ups (TBPP-FU) takes into account not only the number of servers used but also the switch-on processes required to operate them. Due to the challenging size of the resulting ILP models, various tailored reduction strategies can be applied to obtain more tractable formulations. In this article, we show how the information from a heuristic solution can be used to further improve these exact approaches, extending a theoretical result that was previously proven only for some very restrictive cases in the literature. Finally, the benefits of this new reduction procedure will be demonstrated based on computational tests.

Keywords: Cutting and packing; Temporal bin packing; Fire-ups; Heuristics; Reduction (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-08623-6_20

Ordering information: This item can be ordered from
http://www.springer.com/9783031086236

DOI: 10.1007/978-3-031-08623-6_20

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().