Dynamic Programming with Approximation Function for Nurse Scheduling
Although dynamic programming could ideally solve any combinatorial optimization problem, the curse of dimensionality of the search space seriously limits its application to large optimization problems. For example, only few papers in the literature have reported the application of dynamic programming to workforce scheduling problems. This paper investigates approximate dynamic programming to tackle nurse scheduling problems of size that dynamic programming cannot tackle in practice. Nurse scheduling is one of the problems within workforce scheduling that has been tackled with a considerable number of algorithms particularly meta-heuristics. Experimental results indicate that approximate dynamic programming is a suitable method to solve this problem effectively.
KeywordsMarkov decision process Approximate dynamic programming Nurse scheduling problem
- 7.Curtois, T.: Employee shift scheduling benchmark data sets. Technical report, School of Computer Science, The University of Nottingham, Nottingham, UK, September 2014Google Scholar
- 8.Vanhoucke, M., Maenhout, B.: Characterisation and generation of nurse scheduling problem instances. Technical report, Ghent University, Faculty of Economics and Business Administration (2005)Google Scholar
- 11.Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, vol. 1. MIT Press, Cambridge (1998). (No. 1)Google Scholar
- 14.Koole, G., Pot, A.: Approximate dynamic programming in multi-skill call centers. In: 2005 Proceedings of the Winter Simulation Conference, pp. 576–583. IEEE (2005)Google Scholar
- 15.Maenhout, B., Vanhoucke, M.: NSPLib - a nurse scheduling problem library: a tool to evaluate (meta-)heuristic procedures. In: OR in Health, pp. 151–165. Elsevier (2005)Google Scholar