[Zurück]

N. Musliu, A. Schutt, P. Stuckey:
"Solver Independent Rotating Workforce Scheduling";
Vortrag: CPAIOR: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Delft, The Netherlands; 26.06.2018 - 28.06.2018; in: "Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, {CPAIOR} 2018", Springer, 10848 (2018), ISBN: 978-3-319-93030-5; S. 429 - 445.

The rotating workforce scheduling problem aims to schedule workers satisfying shift sequence constraints and ensuring enough shifts are covered on each day, where every worker completes the same sched-ule, just starting at different days in the schedule. We give two solver independent models for the rotating workforce scheduling problem and compare them using different solving technology, both constraint pro-gramming and mixed integer programming. We show that the best of these models outperforms the state-of-the-art for the rotating workforce scheduling problem, and that solver independent modeling allows us to use different solvers to achieve different aims: e.g., speed to solution or robustness of solving (particular for unsatisfiable problems). We give the first complete method able to solve all of the standard benchmarks for this problem.

Solver; Independent; Rotating; Workforce; Scheduling

http://dx.doi.org/10.1007/978-3-319-93031-2_31

Projektleitung Nysret Musliu:
Künstliche Intelligenz in der Personalplanung