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.
Stieber, Anke, Fink, Andreas. 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. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-026-01048-4
Stieber, Anke, Fink, & Andreas (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
Stieber, et al. “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.
@article{Stieber2026,
title = {Modeling and solving workflow scheduling problems on shared computing units with makespan and energy cost objectives},
author = {Stieber and Anke and Fink and Andreas},
journal = {Central European Journal of Operations Research},
year = {2026},
doi = {10.1007/s10100-026-01048-4},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-026-01048-4}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...