Detail of the student project

Topic:Variable depth search for nurse rostering
Supervisor:Přemysl Šůcha
Announce as:PTO
Description:The Nurse rostering Problem (NRP) is a well-known NP-hard combinatorial problem dealing with the management of human resources in a hospital. The goal is to provide as good final rosters as possible while many constraints have to be considered. Good rosters have a significant impact on the quality of health care, the satisfaction of nurses, the hospital budget, etc. This problem can be solved by many different algorithms, both exact and heuristic. The exact algorithms produce optimal solutions but can take really long time to finish. On the other hand, the heuristic algorithms return sub-optimal solutions within the reasonable time. Therefore, the main aim of this project is to implement a heuristic algorithm (and all necessary parts around) based on [2].
Max.number of students:5

Warning: the registration to the PTO can be canceled only by supervisor.
Responsible person: Petr Pošík