| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Hoogeveen, dr. J.A. | |
| dc.contributor.advisor | Bodlaender, prof. dr. H.L. | |
| dc.contributor.author | Hartog, S.J.M. den | |
| dc.date.accessioned | 2016-05-09T17:00:27Z | |
| dc.date.available | 2016-05-09T17:00:27Z | |
| dc.date.issued | 2016 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/22268 | |
| dc.description.abstract | The Nurse Scheduling Problem is a specific rostering problem for situations that need 24-hour coverage. There is a wide variety of constraints, and while some combinations have been proven NP-complete in the past, there is still a large number of problems that remain unclassified. We have defined a number of constraints for a version of the Nurse Scheduling Problem that are common in literature and are able to model a wide variety of problems. For most combinations of these constraints we have shown whether the problem is NP-complete or whether it is polynomially solvable. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 666744 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | On the Complexity of Nurse Scheduling Problems | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Rostering, Complexity, Nurse Scheduling, Scheduling, NP-complete, Network Flow | |
| dc.subject.courseuu | Computing Science | |
