A Constraint Programming Application for Rotating Workforce Scheduling
- 517 Downloads
We describe CP-Rota, a new constraint programming application for rotating workforce scheduling that is currently being developed at our institute to solve real-life problems from industry. It is intended to complement FCS, a previously developed application. The advantages of CP-Rota over FCS are a significantly smaller and more maintainable code base, portability across a range of different language implementations and a more declarative approach that makes extensions easier and mistakes less likely. Our benchmarks show that CP-Rota is already competitive with FCS and even outperforms it on several hard real-life instances from the literature.
KeywordsStaff Scheduling Cyclic Schedule Manpower Scheduling Timetabling
Unable to display preview. Download preview PDF.
- 2.Butler, B.: Computerized manpower scheduling. Master’s thesis, University of Alberta, Canada (1978)Google Scholar
- 5.Heller, N., McEwen, J., Stenzel, W.: Computerized scheduling of police manpower. St. Louis Police Department, St. Louis (1973)Google Scholar
- 8.Mörz, M., Musliu, N.: Genetic algorithm for rotating workforce scheduling. In: Proceedings of second IEEE International Conference on Computational Cybernetics, Vienna, Austria, pp. 121–126 (2004)Google Scholar