On variants of a load-balancing problem with unit-load jobs

Péter Györgyi (), Tamás Kis () and Evelin Szögi ()
Additional contact information
Péter Györgyi: HUN-REN Institute for Computer Science and Control
Tamás Kis: HUN-REN Institute for Computer Science and Control
Evelin Szögi: HUN-REN Institute for Computer Science and Control

Journal of Scheduling, 2025, vol. 28, issue 1, No 5, 138 pages

Abstract: Abstract In this paper, we reconsider an offline load-balancing problem with unit-time jobs that require one unit from a common resource throughout their execution. In the unit-time case, the jobs have to be assigned to time-slots such that a separable convex function of the load of the resource has to be minimized. Variants of this problem have been studied extensively in the literature under different names. We briefly discuss these problems and give a new implementation for one of them with a better worst-case time complexity than any of the known methods. We also consider the more general preemptive problem in which the execution of the jobs can be interrupted and resumed later. Furthermore, we divide the time horizon into disjoint time intervals, and for each interval, a separable convex cost function is given. The jobs have to be scheduled within their feasible intervals preemptively such that the total cost is minimized, where the cost is determined separately for each interval by the corresponding cost function. We show how to solve this problem in polynomial time by a single minimum-cost-flow computation. For the preemptive problem with one cost function only, we propose a proprietary algorithm for finding a feasible solution which is optimal for any convex cost function. We also present some qualitative computational results.

Keywords: Load balancing; Semi-matching; Smart-grid scheduling; Network flows (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-024-00829-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jsched:v:28:y:2025:i:1:d:10.1007_s10951-024-00829-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-024-00829-6

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().