Abstract: Nurse scheduling is a difficult problem that every hospitals faces every month or a week. It impacts the health care system in the hospitals. The Nurse Rostering Problem [NRP] said to be as a subclass of the personnel scheduling problems, and most of its instances are not solvable. Solving the Nurse Rostering Problem has been research field from many years, though, Nurse Rostering is done manually. This paper provides the information about various methodologies for solving NRP and tells NRP can be solved by GA and PGA with the help of review.
Keywords: GPGPU (General Purpose Graphics Processing Units), Constraint Programming, Soft Constraints, Hard Constraints, Genetic Algorithm, Heuristics, Nurse Rostering Problem, Parallel Genetic Algorithm.
Title: Parallelizing Genetic Operators for Solving Nurse Scheduling Problem on GPGPU
Author: Ms. Swapnaja S. Balekar, Ms. N. A. Mhetre
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
