Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems

Rema A. Abobaker, Masri Ayob, Mohammed Hadwan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The Nurse Rostering Problem (NRP) is one of the NP-hard problems that are difficult to solve for optimality. NRP deals with the distribution of working shifts to the staff nurses at healthcare organizations under given rules. Normally, NRP aims at generating a duty roster that satisfies all of the hard constraints (mandatory) and as many soft constraints (optional) as possible. This work introduces a greedy constructive heuristic algorithm, based on building two patterns of two-week's duration that satisfies all of the hard constraints and several soft constraints. The first pattern is designed mainly to fulfill the night shift coverage whilst the second pattern is concerned with morning and evening shifts only. If the solution is not feasible (for example the coverage is not met), a repairing mechanism algorithm is applied until a feasible solution is reached. Simulated Annealing (SA) is then used to improve the constructed solution. A real dataset from Universiti Kebangsaan Malaysia Medical Center (UKMMC) is used in this work to test the proposed approach. Currently, the duty roster at UKMMC is still constructed manually. Promising results have been obtained and presented in this paper.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages194-198
Number of pages5
DOIs
Publication statusPublished - 2011
Event2011 3rd Conference on Data Mining and Optimization, DMO 2011 - Putrajaya
Duration: 28 Jun 201129 Jun 2011

Other

Other2011 3rd Conference on Data Mining and Optimization, DMO 2011
CityPutrajaya
Period28/6/1129/6/11

Fingerprint

Heuristic algorithms
Simulated annealing
Computational complexity

Keywords

  • Greedy Constructive Heuristic
  • Nurse Rostering
  • Simulated Annealing and Scheduling

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Abobaker, R. A., Ayob, M., & Hadwan, M. (2011). Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems. In Conference on Data Mining and Optimization (pp. 194-198). [5976527] https://doi.org/10.1109/DMO.2011.5976527

Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems. / Abobaker, Rema A.; Ayob, Masri; Hadwan, Mohammed.

Conference on Data Mining and Optimization. 2011. p. 194-198 5976527.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abobaker, RA, Ayob, M & Hadwan, M 2011, Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems. in Conference on Data Mining and Optimization., 5976527, pp. 194-198, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976527
Abobaker RA, Ayob M, Hadwan M. Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems. In Conference on Data Mining and Optimization. 2011. p. 194-198. 5976527 https://doi.org/10.1109/DMO.2011.5976527
Abobaker, Rema A. ; Ayob, Masri ; Hadwan, Mohammed. / Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems. Conference on Data Mining and Optimization. 2011. pp. 194-198
@inproceedings{a1f8f227c95e44baa63af2f5d18f9d8a,
title = "Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems",
abstract = "The Nurse Rostering Problem (NRP) is one of the NP-hard problems that are difficult to solve for optimality. NRP deals with the distribution of working shifts to the staff nurses at healthcare organizations under given rules. Normally, NRP aims at generating a duty roster that satisfies all of the hard constraints (mandatory) and as many soft constraints (optional) as possible. This work introduces a greedy constructive heuristic algorithm, based on building two patterns of two-week's duration that satisfies all of the hard constraints and several soft constraints. The first pattern is designed mainly to fulfill the night shift coverage whilst the second pattern is concerned with morning and evening shifts only. If the solution is not feasible (for example the coverage is not met), a repairing mechanism algorithm is applied until a feasible solution is reached. Simulated Annealing (SA) is then used to improve the constructed solution. A real dataset from Universiti Kebangsaan Malaysia Medical Center (UKMMC) is used in this work to test the proposed approach. Currently, the duty roster at UKMMC is still constructed manually. Promising results have been obtained and presented in this paper.",
keywords = "Greedy Constructive Heuristic, Nurse Rostering, Simulated Annealing and Scheduling",
author = "Abobaker, {Rema A.} and Masri Ayob and Mohammed Hadwan",
year = "2011",
doi = "10.1109/DMO.2011.5976527",
language = "English",
isbn = "9781612842127",
pages = "194--198",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - Greedy constructive heuristic and local search algorithm for solving Nurse Rostering Problems

AU - Abobaker, Rema A.

AU - Ayob, Masri

AU - Hadwan, Mohammed

PY - 2011

Y1 - 2011

N2 - The Nurse Rostering Problem (NRP) is one of the NP-hard problems that are difficult to solve for optimality. NRP deals with the distribution of working shifts to the staff nurses at healthcare organizations under given rules. Normally, NRP aims at generating a duty roster that satisfies all of the hard constraints (mandatory) and as many soft constraints (optional) as possible. This work introduces a greedy constructive heuristic algorithm, based on building two patterns of two-week's duration that satisfies all of the hard constraints and several soft constraints. The first pattern is designed mainly to fulfill the night shift coverage whilst the second pattern is concerned with morning and evening shifts only. If the solution is not feasible (for example the coverage is not met), a repairing mechanism algorithm is applied until a feasible solution is reached. Simulated Annealing (SA) is then used to improve the constructed solution. A real dataset from Universiti Kebangsaan Malaysia Medical Center (UKMMC) is used in this work to test the proposed approach. Currently, the duty roster at UKMMC is still constructed manually. Promising results have been obtained and presented in this paper.

AB - The Nurse Rostering Problem (NRP) is one of the NP-hard problems that are difficult to solve for optimality. NRP deals with the distribution of working shifts to the staff nurses at healthcare organizations under given rules. Normally, NRP aims at generating a duty roster that satisfies all of the hard constraints (mandatory) and as many soft constraints (optional) as possible. This work introduces a greedy constructive heuristic algorithm, based on building two patterns of two-week's duration that satisfies all of the hard constraints and several soft constraints. The first pattern is designed mainly to fulfill the night shift coverage whilst the second pattern is concerned with morning and evening shifts only. If the solution is not feasible (for example the coverage is not met), a repairing mechanism algorithm is applied until a feasible solution is reached. Simulated Annealing (SA) is then used to improve the constructed solution. A real dataset from Universiti Kebangsaan Malaysia Medical Center (UKMMC) is used in this work to test the proposed approach. Currently, the duty roster at UKMMC is still constructed manually. Promising results have been obtained and presented in this paper.

KW - Greedy Constructive Heuristic

KW - Nurse Rostering

KW - Simulated Annealing and Scheduling

UR - http://www.scopus.com/inward/record.url?scp=80055052230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80055052230&partnerID=8YFLogxK

U2 - 10.1109/DMO.2011.5976527

DO - 10.1109/DMO.2011.5976527

M3 - Conference contribution

AN - SCOPUS:80055052230

SN - 9781612842127

SP - 194

EP - 198

BT - Conference on Data Mining and Optimization

ER -