A Constraint Programming Application for Rotating Workforce Scheduling

  • Markus Triska
  • Nysret Musliu
Part of the Studies in Computational Intelligence book series (SCI, volume 363)


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.


Staff Scheduling Cyclic Schedule Manpower Scheduling Timetabling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Balakrishnan, N., Wong, R.T.: A network model for the rotating workforce scheduling problem. Networks 20, 25–42 (1990)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Butler, B.: Computerized manpower scheduling. Master’s thesis, University of Alberta, Canada (1978)Google Scholar
  3. 3.
    Chan, P., Weil, G.: Cyclical staff scheduling using constraint logic programming. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 159–175. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Gärtner, J., Musliu, N., Slany, W.: Rota: A research project on algorithms for workforce scheduling and shift design optimisation. Artificial Intelligence Communications 14(2), 83–92 (2001)zbMATHGoogle Scholar
  5. 5.
    Heller, N., McEwen, J., Stenzel, W.: Computerized scheduling of police manpower. St. Louis Police Department, St. Louis (1973)Google Scholar
  6. 6.
    Laporte, G.: The art and science of designing rotating schedules. Journal of the Operational Research Society 50, 1011–1017 (1999)zbMATHGoogle Scholar
  7. 7.
    Laporte, G., Pesant, G.: A general multi-shift scheduling system. Journal of the Operational Research Society 55(11), 1208–1217 (2004)zbMATHCrossRefGoogle Scholar
  8. 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
  9. 9.
    Musliu, N., Gärtner, J., Slany, W.: Efficient generation of rotating workforce schedules. Discrete Applied Mathematics 118(1-2), 85–98 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Musliu, N.: Heuristic Methods for Automatic Rotating Workforce Scheduling. International Journal of Computational Intelligence Research 2(4), 309–326 (2006)CrossRefGoogle Scholar
  11. 11.
    Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Markus Triska
    • 1
  • Nysret Musliu
    • 1
  1. 1.Database and Artificial Intelligence GroupVienna University of TechnologyAustria

Personalised recommendations