[Back]


Talks and Poster Presentations (with Proceedings-Entry):

L. Kletzander, N. Musliu:
"Modelling and Solving the Minimum Shift Design Problem";
Talk: CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece; 2019-06-04 - 2019-06-07; in: "Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, {CPAIOR} 2019, Proceedings", Springer, 11494 (2019), ISBN: 978-3-030-19211-2; 391 - 408.



English abstract:
When demand for employees varies throughout the day, the minimum shift design (MSD) problem aims at placing a minimum number of shifts that cover the demand with minimum overstaffing and understaffing. This paper investigates different constraint models for the problem, using a direct representation, a counting representation and a network flow based model and applies both constraint programming (CP) and mixed integer programming (MIP) solvers. The results show that the model based on network flow clearly outperforms the other models. While a CP solver finds some optimal results, with MIP solvers it can for the first time provide optimal solutions to all existing benchmark instances in short computational time.

Keywords:
Shift design Constraint programming Mixed integer programming Network flow


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-030-19212-9



Related Projects:
Project Head Nysret Musliu:
ARTIOS


Created from the Publication Database of the Vienna University of Technology.