A nurse scheduling using graph colouring

Thumbnail Image
Journal Title
Journal ISSN
Volume Title
The aim of this thesis work is to provide effective method for solving Nurse Scheduling Problem (NSP) by satisfying the nurses, patients and hospital requirements. Nurse schedule problem is a major problem faced by many hospitals all over the world. That is a subclass of scheduling problems that are hard to solve. The work is difficult for the duty planner because the duty planner has to ensure that every scheduling decision made complies with a mixture of hard hospital rules and soft nurse preference rules. The thesis describes the design and implementation of a constraint-based nurse scheduling using graph colouring. A conflict graph was constructed and the vertices of the graph represented the different types of nurses. The vertices were then coloured using Greedy algorithm approach and this removed the various conflicts. The result was then used to create the nurses schedule. Results showed a feasible solution to the problem.
A thesis submitted to the Department of Industrial Mathematics Kwame Nkrumah University of Science and Technology in partial fulfillment of the requirements for the degree of Master of Science.