Abstract
Scheduling shifts is a tiresome and time consuming task in any business, and particularly in hospitals where errors are costly, rules are plentiful and changes are rapid. The person performing this function (Rota Organizer) will have to keep track of all the employees concerned, distributing hours fairly and avoiding collisions. Rules regulating working hours and breaks have to be followed and the qualifications of individual employees need to be considered. Hours are spent every day on this task in every ward. The goal of this paper is to solve Doctors Scheduling Problem (DSP) and initialize a fair roster for two wards of Pediatric Department (PD) in Prince Sultan Military Medical City (PSMMC) in Saudi Arabia. So to find a solution of DSP, we used Graph Coloring which is one of the methods used mostly to solve this problem.
Highlights
In the study of graphs, which are mathematical structures used to model pair wise relations between objects
The surge for studying graph coloring in recent times has resulted in countless real-life problem applications, which include scheduling problems
Research presented in this paper aims to provide an effective procedure for solving Doctors Scheduling Problem (DSP) related to their shifts
Summary
In the study of graphs, which are mathematical structures used to model pair wise relations between objects. There are consultants, senior and junior doctors working in this department. This paper is concerned with scheduling shifts for junior and senior doctors in two of the department wards for one month only.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
