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 programmin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Verlag
2016
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/35585/ |
| _version_ | 1848795114168647680 |
|---|---|
| author | Shi, Peng Landa-Silva, Dario |
| author_facet | Shi, Peng Landa-Silva, Dario |
| author_sort | Shi, Peng |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:26:56Z |
| format | Article |
| id | nottingham-35585 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T19:26:56Z |
| publishDate | 2016 |
| publisher | Springer Verlag |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-355852020-05-08T11:45:24Z https://eprints.nottingham.ac.uk/35585/ Dynamic programming with approximation function for nurse scheduling Shi, Peng Landa-Silva, Dario 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. Springer Verlag 2016-12-25 Article PeerReviewed application/pdf en https://eprints.nottingham.ac.uk/35585/1/dls_mod2016.pdf Shi, Peng and Landa-Silva, Dario (2016) Dynamic programming with approximation function for nurse scheduling. Lecture Notes in Computer Science, 10122 . pp. 269-280. ISSN 0302-9743 Markov Decision Process Approximate Dynamic Programming Nurse Scheduling Problem https://link.springer.com/chapter/10.1007/978-3-319-51469-7_23 doi:10.1007/978-3-319-51469-7_23 doi:10.1007/978-3-319-51469-7_23 |
| spellingShingle | Markov Decision Process Approximate Dynamic Programming Nurse Scheduling Problem Shi, Peng Landa-Silva, Dario Dynamic programming with approximation function for nurse scheduling |
| title | Dynamic programming with approximation function for nurse scheduling |
| title_full | Dynamic programming with approximation function for nurse scheduling |
| title_fullStr | Dynamic programming with approximation function for nurse scheduling |
| title_full_unstemmed | Dynamic programming with approximation function for nurse scheduling |
| title_short | Dynamic programming with approximation function for nurse scheduling |
| title_sort | dynamic programming with approximation function for nurse scheduling |
| topic | Markov Decision Process Approximate Dynamic Programming Nurse Scheduling Problem |
| url | https://eprints.nottingham.ac.uk/35585/ https://eprints.nottingham.ac.uk/35585/ https://eprints.nottingham.ac.uk/35585/ |