Modeling and solving workflow scheduling problems on shared computing units with makespan and energy cost objectives
Central European Journal of Operations Research · 16.11.2026
DOI: 10.1007/s10100-026-01048-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Central European Journal of Operations Research, online erschienen am 16.11.2026. Verfasst von Anke Stieber und 1 weiteren Autor:innen. Die Arbeit nennt 59 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Helmut-Schmidt-Universität Universität der Bundeswehr Hamburg.
Abstract (Originalsprache)
This research addresses the workflow scheduling problem on shared computing units. A set of interdependent tasks, originating from a workflow or project, requires processing by computing units such as virtual machines, while respecting precedence constraints and capacity restrictions, for example, in terms of virtual central processing units. The computing units may be heterogeneous or homogeneous in their capacities and cost rates. This problem arises in cloud environments that allow multiple tasks to share resources to improve utilization and reduce energy consumption in accordance with a race-to-idle strategy. We present different mathematical model formulations for this integrated model of workflow scheduling and vector bin packing: a mixed-integer program based on the pulse disaggregated discrete-time formulation, a mixed-integer quadratically constrained program, and a constraint programming satisfiability model, which can be further extended to related scheduling settings. The formulations are evaluated under a makespan objective and under a weighted-sum objective combining makespan and active-unit energy cost. Computational experiments with the Gurobi Optimizer and the CP-SAT solver show that the pulse-based formulation provides the strongest bounds and proves optimality most often, whereas the constraint programming formulation quickly finds high-quality incumbent solutions for the combined objective.
Förderung
- Helmut-Schmidt-Universität Universität der Bundeswehr Hamburg
Zitieren
APA
Stieber, A., & Fink, A. (2026). Modeling and solving workflow scheduling problems on shared computing units with makespan and energy cost objectives. Central European Journal of Operations Research. https://doi.org/10.1007/s10100-026-01048-4
Vancouver
Stieber A, Fink A. Modeling and solving workflow scheduling problems on shared computing units with makespan and energy cost objectives. Central European Journal of Operations Research. 2026. doi:10.1007/s10100-026-01048-4
BibTeX
@article{Stieber2026,
author = {Stieber, Anke and Fink, Andreas},
title = {Modeling and solving workflow scheduling problems on shared computing units with makespan and energy cost objectives},
journal = {Central European Journal of Operations Research},
year = {2026},
doi = {10.1007/s10100-026-01048-4}
}
EUVIMED