IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-08623-6_20.html
   My bibliography  Save this book chapter

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

In: Operations Research Proceedings 2021

Author

Listed:
  • John Martinovic

    (Technische Universität Dresden)

  • Nico Strasdat

    (Technische Universität Dresden)

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.

Suggested Citation

  • John Martinovic & Nico Strasdat, 2022. "A Heuristic-Based Reduction for the Temporal Bin Packing Problem with Fire-Ups," Lecture Notes in Operations Research, in: Norbert Trautmann & Mario Gnägi (ed.), Operations Research Proceedings 2021, pages 127-133, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-08623-6_20
    DOI: 10.1007/978-3-031-08623-6_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnopch:978-3-031-08623-6_20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.