[Back]


Talks and Poster Presentations (with Proceedings-Entry):

L. Kletzander, N. Musliu, J. Gärtner, J. Krennwallner, W. Schafhauser:
"Exact Methods for Extended Rotating Workforce Scheduling Problems";
Talk: ICAPS 2019 - 29th International Conference on Automated Planning and Scheduling, Berkeley, USA; 2019-07-10 - 2019-07-15; in: "Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2018, Berkeley, CA, USA, July 11-15, 2019", AAAI Press, (2019), ISSN: 2334-0843; 519 - 527.



English abstract:
In many professions daily demand for different shifts varies during the week. The rotating workforce scheduling problem deals with the creation of repeating schedules for such de-mand and is therefore of high practical relevance. This paper investigates solving this real-life problem with several new practically relevant features. This includes early recognition of certain infeasibility criteria, complex rest time constraints regarding weekly rest time, and optimization goals to deal with optimal assignments of free weekends. We introduce a state-of-the-art constraint model and evaluate it with differ-ent extensions. The evaluation shows that many real-life in-stances can be solved to optimality using a constraint solver. Our approach is under deployment in a state-of-the-art com-mercial solver for rotating workforce scheduling.


Related Projects:
Project Head Nysret Musliu:
ARTIOS


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