Dp 225 en
Hospital Nurse Scheduling[editovat]
Author: Zdeněk Bäumelt
The aim of this diploma thesis is the development of an application for solving Nurse Scheduling Problem. This problem belongs to scheduling problems domain, exactly timetabling problems domain. For solving this NP hard problem, it is necessary to consider large amount of constraints (minimum number of nurses for each type of shift, nurses' workload, balanced shift assigning, nurses' requests consideration, etc.). Another application constraint is designing schedule in an acceptable period of time.
The scope of this work is to introduce various scheduling algorithms suitable for solving the problem and to implement a self-made scheduling algorithm. The final product of this diploma thesis is a web application for solving Nurse Scheduling Problem implemented in .NET Framework.
- Bäumelt Zdeněk, tel: +420732350143, mailto:Baumelt.Zdenek@seznam.cz