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
Degree of approximation of Conjugate Series of a Fourier Series by (E,r)(N,p,q) Means
In this paper a theorem on degree of approximation of a function f Lip ? by product Summability(E,r)(N,p,q)of conjugate series of Fourier series associated with f, has been established.
INTEGRAL SOLUTIONS
We obtain the non-trival integral solutions for quartic Diaphoptine equations with two variables is presented. A few numerical examples are given.
ON GENERALIZATION OF INJECTIVE MODULES
Here we introduce the concept of CK-N-injectivity as a gen-eralization of N-injectivity. We give a homomorphism diagram representation of such concept, as well as an equivalent condition in terms of module decompositions...
Generalized Fuzzy Soft Connected Sets in Generalized Fuzzy Soft Topological Spaces
In this paper we introduce some types of generalized fuzzy soft separated sets and study some of their properties. Next, the notion of connectedness in fuzzy soft topological spaces due to Karata et al, Mahanta et al, an...
Results on n-tupled fixed points in complete ordered metric spaces.
The aim of this paper is to study n-tupled coincidence and n-tupled fixed point results, a new notion propounded by M.Imdad et.al.[13] for compatible maps in partially ordered metric spaces. Our results generalize,...