Solving Nurse Scheduling Problem Using Constraint Programming (CP) Technique

M. Alade, Oluwaseun and Amusat, Akeem O. and Adedeji, Oluyinka T. (2019) Solving Nurse Scheduling Problem Using Constraint Programming (CP) Technique. Asian Journal of Research in Computer Science, 3 (2). pp. 1-8. ISSN 2581-8260

[thumbnail of Amusat322019AJRCOS47983.pdf] Text
Amusat322019AJRCOS47983.pdf - Published Version

Download (225kB)

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.

Item Type: Article
Subjects: Apsci Archives > Computer Science
Depositing User: Unnamed user with email support@apsciarchives.com
Date Deposited: 12 Apr 2023 05:14
Last Modified: 07 Feb 2024 04:46
URI: http://eprints.go2submission.com/id/eprint/694

Actions (login required)

View Item
View Item