Solving Nurse Scheduling Problem Using Constraint Programming (CP) Technique

  • M. Alade O
  • Amusat A
  • Adedeji O
N/ACitations
Citations of this article
39Readers
Mendeley users who have this article in their library.

Abstract

Staff scheduling is a universal problem that can be encountered in many organizations, such as call centers, educational institution, industry, hospital, and any other public services. It is one of the most important aspects of workforce management strategy. Mostly, it is prone to errors or issues as there are many entities that should be addressed, such as the staff turnover, employee availability, time between rotations, unusual periods of activity, and even the last-minute shift changes. In this paper, constraint programming (CP) algorithm was developed to solve the nurse scheduling problem. The developed constraint programming algorithm was then implemented using python programming language. The developed CP algorithm was experimented with varying number of nurses. Experimental result confirmed that CP algorithm was able to solve nurse scheduling problem with promising results.

Cite

CITATION STYLE

APA

M. Alade, O., Amusat, A. O., & Adedeji, O. T. (2019). Solving Nurse Scheduling Problem Using Constraint Programming (CP) Technique. Asian Journal of Research in Computer Science, 1–8. https://doi.org/10.9734/ajrcos/2019/v3i230088

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free