A constructive shift patterns approach with simulated annealing for Nurse Rostering problem

Mohammed Hadwan, Masri Ayob

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

11 Citations (Scopus)

Abstract

Nurse Rostering problem (NRP) is an NP-Hard problem, which is difficult to solve for its optimality. This work aims to ensure the availability of enough nurses, by giving them fair consideration during the rostering period. In order to achieve this, we proposed a greedy constructive heuristic algorithm based on the idea of generating the most required shift patterns first to solve the nurses' rostering problem at Universiti Kebangsaan Malaysia Medical Centre (UKMMC), Malaysia. That is, this approach attempts to reduce the complexity of the solution search space by generating all the allowed two-day and three-day shift patterns to build up the roster. We then use simulated annealing algorithm to improve the quality of the roster. The resulting roster demonstrates that our proposed approach generates a good quality roster in a reasonable time for our case study.

Original languageEnglish
Title of host publicationProceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10
Volume1
DOIs
Publication statusPublished - 2010
Event2010 International Symposium on Information Technology, ITSim'10 - Kuala Lumpur
Duration: 15 Jun 201017 Jun 2010

Other

Other2010 International Symposium on Information Technology, ITSim'10
CityKuala Lumpur
Period15/6/1017/6/10

Fingerprint

Heuristic algorithms
Simulated annealing
Computational complexity
Availability

Keywords

  • Heuristic
  • Meta-heuristic and timetabling
  • Workforce

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Hadwan, M., & Ayob, M. (2010). A constructive shift patterns approach with simulated annealing for Nurse Rostering problem. In Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10 (Vol. 1). [5561304] https://doi.org/10.1109/ITSIM.2010.5561304

A constructive shift patterns approach with simulated annealing for Nurse Rostering problem. / Hadwan, Mohammed; Ayob, Masri.

Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10. Vol. 1 2010. 5561304.

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

Hadwan, M & Ayob, M 2010, A constructive shift patterns approach with simulated annealing for Nurse Rostering problem. in Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10. vol. 1, 5561304, 2010 International Symposium on Information Technology, ITSim'10, Kuala Lumpur, 15/6/10. https://doi.org/10.1109/ITSIM.2010.5561304
Hadwan M, Ayob M. A constructive shift patterns approach with simulated annealing for Nurse Rostering problem. In Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10. Vol. 1. 2010. 5561304 https://doi.org/10.1109/ITSIM.2010.5561304
Hadwan, Mohammed ; Ayob, Masri. / A constructive shift patterns approach with simulated annealing for Nurse Rostering problem. Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10. Vol. 1 2010.
@inproceedings{6f495d7ed5b84913b1619567269cf5ee,
title = "A constructive shift patterns approach with simulated annealing for Nurse Rostering problem",
abstract = "Nurse Rostering problem (NRP) is an NP-Hard problem, which is difficult to solve for its optimality. This work aims to ensure the availability of enough nurses, by giving them fair consideration during the rostering period. In order to achieve this, we proposed a greedy constructive heuristic algorithm based on the idea of generating the most required shift patterns first to solve the nurses' rostering problem at Universiti Kebangsaan Malaysia Medical Centre (UKMMC), Malaysia. That is, this approach attempts to reduce the complexity of the solution search space by generating all the allowed two-day and three-day shift patterns to build up the roster. We then use simulated annealing algorithm to improve the quality of the roster. The resulting roster demonstrates that our proposed approach generates a good quality roster in a reasonable time for our case study.",
keywords = "Heuristic, Meta-heuristic and timetabling, Workforce",
author = "Mohammed Hadwan and Masri Ayob",
year = "2010",
doi = "10.1109/ITSIM.2010.5561304",
language = "English",
isbn = "9781424467181",
volume = "1",
booktitle = "Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10",

}

TY - GEN

T1 - A constructive shift patterns approach with simulated annealing for Nurse Rostering problem

AU - Hadwan, Mohammed

AU - Ayob, Masri

PY - 2010

Y1 - 2010

N2 - Nurse Rostering problem (NRP) is an NP-Hard problem, which is difficult to solve for its optimality. This work aims to ensure the availability of enough nurses, by giving them fair consideration during the rostering period. In order to achieve this, we proposed a greedy constructive heuristic algorithm based on the idea of generating the most required shift patterns first to solve the nurses' rostering problem at Universiti Kebangsaan Malaysia Medical Centre (UKMMC), Malaysia. That is, this approach attempts to reduce the complexity of the solution search space by generating all the allowed two-day and three-day shift patterns to build up the roster. We then use simulated annealing algorithm to improve the quality of the roster. The resulting roster demonstrates that our proposed approach generates a good quality roster in a reasonable time for our case study.

AB - Nurse Rostering problem (NRP) is an NP-Hard problem, which is difficult to solve for its optimality. This work aims to ensure the availability of enough nurses, by giving them fair consideration during the rostering period. In order to achieve this, we proposed a greedy constructive heuristic algorithm based on the idea of generating the most required shift patterns first to solve the nurses' rostering problem at Universiti Kebangsaan Malaysia Medical Centre (UKMMC), Malaysia. That is, this approach attempts to reduce the complexity of the solution search space by generating all the allowed two-day and three-day shift patterns to build up the roster. We then use simulated annealing algorithm to improve the quality of the roster. The resulting roster demonstrates that our proposed approach generates a good quality roster in a reasonable time for our case study.

KW - Heuristic

KW - Meta-heuristic and timetabling

KW - Workforce

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

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

U2 - 10.1109/ITSIM.2010.5561304

DO - 10.1109/ITSIM.2010.5561304

M3 - Conference contribution

SN - 9781424467181

VL - 1

BT - Proceedings 2010 International Symposium on Information Technology - Visual Informatics, ITSim'10

ER -