|
|||||
|
|
On the complexity of Nurse Rostering problems |
|
| Institution: | 1. Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands;2. Department of Data Analytics and Digitalisation, Maastricht University, Maastricht, the Netherlands |
| Abstract: | |
| Keywords: | Scheduling Complexity NP-completeness Nurse scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ | |