A two-stage heuristic approach for nurse scheduling problem : a case study in an emergency department

Wong, T. C. and Xu, M. and Chin, K. S. (2014) A two-stage heuristic approach for nurse scheduling problem : a case study in an emergency department. Computers & Operations Research, 51. pp. 99-110. ISSN 0305-0548

[thumbnail of COR_2014_final]
PDF (COR_2014_final)
Accepted Author Manuscript

Download (1MB)| Preview


    Nurse scheduling is a critical issue in the management of emergency department. Under the intense work environment, it is imperative to make quality nurse schedules in a most cost and time effective way. To this end, a spreadsheet-based two-stage heuristic approach is proposed for the nurse scheduling problem (NSP) in a local emergency department. First, an initial schedule satisfying all hard constraints is generated by the simple shift assignment heuristic. Second, the sequential local search algorithm is employed to improve the initial schedules by taking soft constraints (nurse preferences) into account. The proposed approach is benchmarked with the existing approach and 0-1 programming. The contribution of this paper is twofold. First, it is one of a few studies in nurse scheduling literature using heuristic approach to generate nurse schedules based on Excel spreadsheet. Therefore, users with little knowledge on linear programming and computer sciences can operate and change the scheduling algorithms easily. Second, while most studies on nurse scheduling are situated in hospitals, this paper attempts to bridge the research gap by investigating the NSP in the emergency department where the scheduling rules are much more restrictive due to the intense and dynamic work environment. Overall, our approach generates satisfactory schedules with higher level of user-friendliness, efficiency, and flexibility of rescheduling as compared to both the existing approach and 0-1 programming.

    ORCID iDs

    Wong, T. C. ORCID logoORCID: https://orcid.org/0000-0001-8942-1984, Xu, M. and Chin, K. S.;