Solver Independent Rotating Workforce Scheduling
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 schedule, 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 programming 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.
This work was partially supported by the Asian Office of Aerospace Research and Development grant 15-4016 and by the Austrian Science Fund (FWF): P24814-N23.
- 3.Belov, G., Stuckey, P.J., Tack, G., Wallace, M.G.: Improved linearization of constraint programming models. In: Rueher, M. (ed.) Principles and Practice of Constraint Programming - CP 2016, pp. 49–65. Springer International Publishing, Cham (2016)Google Scholar
- 6.Chu, G.: Improving combinatorial optimization. Ph.D. thesis, The University of Melbourne (2011). http://hdl.handle.net/11343/36679
- 12.Erkinger, C., Musliu, N.: Personnel scheduling as satisfiability modulo theories. In: International Joint Conference on Artificial Intelligence - IJCAI 2017, Melbourne, Australia, 19–25 August 2017, pp. 614–621 (2017)Google Scholar
- 16.Kadioglu, S., Sellmann, M.: Efficient context-free grammar constraints. In: AAAI, pp. 310–316 (2008)Google Scholar
- 20.Musliu, N.: Combination of local search strategies for rotating workforce scheduling problem. In: International Joint Conference on Artificial Intelligence - IJCAI 2005, Edinburgh, Scotland, UK, 30 July - 5 August 2005, pp. 1529–1530 (2005). http://ijcai.org/Proceedings/05/Papers/post-0448.pdf
- 28.Triska, M., Musliu, N.: A constraint programming application for rotating workforce scheduling. In: Mehrotra, K.G., Mohan, C., Oh, J.C., Varshney, P.K., Ali, M. (eds.) Developing Concepts in Applied Intelligence. SCI, vol. 363, pp. 83–88. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21332-8_12CrossRefGoogle Scholar