Hardware and software for distributed and supercomputer systems
Research Article
Compact MILP Model for Scheduling Multi-Stage DAGs with Homogeneous Dependencies in the Cloud
Yury Dmitrievich Semenov1
, Oleg Viktirovich Sukhoroslov2
| 1 | HSE University, Moscow, Russia |
| 2 | Institute for Information Transmission Problems of the Russian Academy of Sciences, Moscow, Russia |
| 1 |
|
Abstract.
In this paper, we consider the problem of scheduling directed acyclic graphs (DAGs) of computational tasks in the cloud to minimize makespan or execution cost.
An important part of research on solving challenging scheduling problems is designing mixed-integer linear programming models in order to use them with an exact solver, or as a source of linear programming relaxations.
The existing MILP models for DAG scheduling in the cloud have a large number of variables and constraints, and are known to be notoriously hard to solve.
While in general these models are hard to improve, DAGs encountered in practice often have remarkable structural properties that may be exploited to design better models.
We capitalize on such properties to devise a more compact and solvable MILP model for DAGs consisting of multiple stages (layers) with homogeneous data dependencies.
The advantages of the proposed model are demonstrated by computational experiments. (Linked article texts in English and in Russian).
Keywords: DAG scheduling, cloud computing, mathematical modeling, mixed-integer linear programming
MSC-2020
68M20; 90C11,90C05Acknowledgments: The research was carried out within the state assignment of Ministry of Science and Higher Education of the Russian Federation for IITP RAS.
For citation: Yury D. Semenov, Oleg V. Sukhoroslov. Compact MILP Model for Scheduling Multi-Stage DAGs with Homogeneous Dependencies in the Cloud. Program Systems: Theory and Applications, 2026, 17:3, pp. 275–314. (in Engl. In Russ.). https://psta.psiras.ru/2026/3_275-314.
Full text of bilingual article (PDF): https://psta.psiras.ru/read/psta2026_3_275-314.pdf (Clicking on the flag in the header switches the page language).
The article was submitted 29.05.2026; approved after reviewing 29.05.2026; accepted for publication 28.07.2026; published online 21.09.2026.