Applying Graph Coloring To Schedule Doctors' Work In A Hospital.
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2016, Vol 12, Issue 11
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.
Authors and Affiliations
Ferdous Omar Taoufic
Keywords
Related Articles
- EP ID EP651757
- DOI 10.24297/jam.v12i11.4506
- Views 173
- Downloads 0
Some methods for calculating limits
Below we present some methods for calculating the limits of the numerical sequence.
A NEW CONSTRUCTION OF MULTIWAVELETS WITH COMPOSITE DILATIONS
Consider an affine system AABwith composite dilations Da,D in which anand .It can be made an orthonormal AB multiwavelet or a parsval frame AB -wavelet ,by choosing appropriate s...
Convergence of the Collatz Sequence
For any natural number was created the supplement sequence, that is convergent together with the original Collatz sequence. The numerical parameter - index was defined, that is the same for both sequences. This new metho...
Single-Layer Raster CNN simulator using RK-Gill
An efficient numerical integration algorithm for single layer Raster Cellular Neural Networks (CNN) simulator is presented in this paper. The simulator is capable of performing CNN simulations for any size of input image...
Odd and Even Ratio Edge Antimagic Labeling
In this paper we introduce a new labeling namely odd and even ratio edge antimagic labeling and study the existence of this labeling for basic graph structures .