A Best-Cost Based Heuristic for Busy Time Minimization

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

Chapter Chapter 61 in Operations Research Proceedings 2023, 2025, pp 477-483 from Springer

Abstract: Abstract Given a set of jobs (or items), each of which being characterized by its resource demand and its lifespan, and a sufficiently large number of identical servers (or bins), the busy time minimization problem (BTMP) requires to find a feasible jobs-to-servers assignment having minimum overall power-on time. Although BTMP can be classified as a variant of temporal bin packing, it actually represents an independent branch of research since, for instance, the related solution sets are generally different. Typically, such computations (and generalizations of it) are very important in data center workload management to keep operational costs low. Hence, finding efficient solution techniques for BTMP is a relevant topic in discrete optimization, both from a theoretical and a practical point of view. In this work, we first give an overview of heuristic approaches for the problem under consideration. As a main contribution, a new best-cost based heuristic is presented as well as theoretically analyzed, and it is empirically shown to improve the quality of feasible solutions obtained for a set of challenging benchmark instances.

Keywords: Cutting and packing; Bin packing problem; Busy time minimization; Scheduling (search for similar items in EconPapers)
Date: 2025
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-58405-3_61

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

DOI: 10.1007/978-3-031-58405-3_61

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 ().