GPMS: A Generalized Parallel Machine Scheduling Framework with Rich Temporal and Resource Constraints
Proceedings of the International Conference on Automated Planning and Scheduling · 08.06.2026 · 36 (1) · 490-499
DOI: 10.1609/icaps.v36i1.42866 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Conference on Automated Planning and Scheduling, online erschienen am 08.06.2026. Verfasst von Lukas Frühwirth und 3 weiteren Autor:innen.
Abstract (Originalsprache)
Classical scheduling problems such as Unrelated Parallel Machine Scheduling (UPMSP), Flexible Job Shop Scheduling (FJSP), and Resource-Constrained Project Scheduling (RCPSP) each capture important aspects of industrial scheduling, but real-world applications often require a combination of constraints from several of these formulations and additional requirements that are typically not supported in standard models. We propose a Generalized Parallel Machine Scheduling (GPMS) framework that, to the best of our knowledge, is the most general machine scheduling formulation to date and unifies machine eligibility with machine-dependent processing times, sequence- and machine-dependent setup times, rich temporal constraints, and secondary-resource constraints in a single formulation. Temporal constraints include machine calendars and precedence relations with min/max time lags and conditional machine eligibilities. Secondary resources are modeled with capacity calendars and pulse or step demands. To model and solve this generalized problem, we investigate a constraint programming approach and propose two CP models: a solver-agnostic high-level model and an interval-variable model. We also develop a randomized construction heuristic that finds feasible, high-quality schedules even for large and highly constrained instances; these schedules serve as warm starts for the interval-variable model. We evaluate 216 generated and 91 real-world instances, comparing the interval-variable model to the solver-agnostic model and to the construction heuristic. The warm-start interval-variable model attains the best objective on the majority of both generated and real-world instances, proves optimality for many small-to-medium instances, and finds near-optimal schedules for most industrial instances within a one-hour time limit. We release all models, code, and instances to support reproducible research.
Zitieren
APA
Frühwirth, L., Einspieler, C., Musliu, N., & Winter, F. (2026). GPMS: A Generalized Parallel Machine Scheduling Framework with Rich Temporal and Resource Constraints. Proceedings of the International Conference on Automated Planning and Scheduling, 36(1), 490-499. https://doi.org/10.1609/icaps.v36i1.42866
Vancouver
Frühwirth L, Einspieler C, Musliu N, Winter F. GPMS: A Generalized Parallel Machine Scheduling Framework with Rich Temporal and Resource Constraints. Proceedings of the International Conference on Automated Planning and Scheduling. 2026;36(1):490-499. doi:10.1609/icaps.v36i1.42866
BibTeX
@article{Frhwirth2026,
author = {Frühwirth, Lukas and Einspieler, Christoph and Musliu, Nysret and Winter, Felix},
title = {GPMS: A Generalized Parallel Machine Scheduling Framework with Rich Temporal and Resource Constraints},
journal = {Proceedings of the International Conference on Automated Planning and Scheduling},
year = {2026},
volume = {36},
number = {1},
pages = {490--499},
doi = {10.1609/icaps.v36i1.42866}
}
EUVIMED