A semi-cyclic shift patterns approach for nurse rostering problems

Mohammed Hadwan, Masri Ayob

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

2 Citations (Scopus)

Abstract

The paper, at hand, introduces a semi-cyclic shift patterns approach (SCSPA) that solves nurse rostering problem (NRP) at the Medical Centre, Universiti Kebangsaan Malaysia (UKMMC). Since night shift is the most problematic shift to assign due to the extra constraints that it has, the paper proposes a combination of semi-cyclic approach, which first allocates a predesigned night shift patterns cyclically, then allocates a combined morning and evening shift patterns in a non-cyclic manner until fulfilling the hard constraints. This is different from our previous work that adopted a non-cyclic shift pattern approach (NCSPA) to construct all of the possible valid shift patterns, which were a combination of morning, evening and night shifts which were incorporated to yield one-week shift patterns. Next, two shift patterns of one-week were allocated for each nurse until construct the initial roster. This paper presents a comparison between the proposed semi-cyclic approach and the previous non-cyclic approach. Beside the minimum violation penalty, we count the number of good patterns that each algorithm produces in order to measure the quality of constructed duty roster. Then, the approach applies simulated annealing algorithm in order to improve the overall produced roster as to enhance the initial roster that resulted from both algorithms. By using a semi-cyclic approach, two benefits over our previous work are gained, (i) the number of constructed shift patterns decreased remarkably, thus reduces the construction time; and (ii) allocating night shift patterns fairly for all nurses becomes more manageable. Based on the obtained results, the semi-cyclic approach yields a better duty roster as it produces more good patterns compared to our previous Non-cyclic approach.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages184-189
Number of pages6
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

Simulated annealing

Keywords

  • heuristic
  • Meta-heuristic
  • Nurses
  • semi-cyclic
  • timetabling and scheduling

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Hadwan, M., & Ayob, M. (2011). A semi-cyclic shift patterns approach for nurse rostering problems. In Conference on Data Mining and Optimization (pp. 184-189). [5976525] https://doi.org/10.1109/DMO.2011.5976525

A semi-cyclic shift patterns approach for nurse rostering problems. / Hadwan, Mohammed; Ayob, Masri.

Conference on Data Mining and Optimization. 2011. p. 184-189 5976525.

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

Hadwan, M & Ayob, M 2011, A semi-cyclic shift patterns approach for nurse rostering problems. in Conference on Data Mining and Optimization., 5976525, pp. 184-189, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976525
Hadwan M, Ayob M. A semi-cyclic shift patterns approach for nurse rostering problems. In Conference on Data Mining and Optimization. 2011. p. 184-189. 5976525 https://doi.org/10.1109/DMO.2011.5976525
Hadwan, Mohammed ; Ayob, Masri. / A semi-cyclic shift patterns approach for nurse rostering problems. Conference on Data Mining and Optimization. 2011. pp. 184-189
@inproceedings{fc9952c8491a4347a479c854b4c8b938,
title = "A semi-cyclic shift patterns approach for nurse rostering problems",
abstract = "The paper, at hand, introduces a semi-cyclic shift patterns approach (SCSPA) that solves nurse rostering problem (NRP) at the Medical Centre, Universiti Kebangsaan Malaysia (UKMMC). Since night shift is the most problematic shift to assign due to the extra constraints that it has, the paper proposes a combination of semi-cyclic approach, which first allocates a predesigned night shift patterns cyclically, then allocates a combined morning and evening shift patterns in a non-cyclic manner until fulfilling the hard constraints. This is different from our previous work that adopted a non-cyclic shift pattern approach (NCSPA) to construct all of the possible valid shift patterns, which were a combination of morning, evening and night shifts which were incorporated to yield one-week shift patterns. Next, two shift patterns of one-week were allocated for each nurse until construct the initial roster. This paper presents a comparison between the proposed semi-cyclic approach and the previous non-cyclic approach. Beside the minimum violation penalty, we count the number of good patterns that each algorithm produces in order to measure the quality of constructed duty roster. Then, the approach applies simulated annealing algorithm in order to improve the overall produced roster as to enhance the initial roster that resulted from both algorithms. By using a semi-cyclic approach, two benefits over our previous work are gained, (i) the number of constructed shift patterns decreased remarkably, thus reduces the construction time; and (ii) allocating night shift patterns fairly for all nurses becomes more manageable. Based on the obtained results, the semi-cyclic approach yields a better duty roster as it produces more good patterns compared to our previous Non-cyclic approach.",
keywords = "heuristic, Meta-heuristic, Nurses, semi-cyclic, timetabling and scheduling",
author = "Mohammed Hadwan and Masri Ayob",
year = "2011",
doi = "10.1109/DMO.2011.5976525",
language = "English",
isbn = "9781612842127",
pages = "184--189",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - A semi-cyclic shift patterns approach for nurse rostering problems

AU - Hadwan, Mohammed

AU - Ayob, Masri

PY - 2011

Y1 - 2011

N2 - The paper, at hand, introduces a semi-cyclic shift patterns approach (SCSPA) that solves nurse rostering problem (NRP) at the Medical Centre, Universiti Kebangsaan Malaysia (UKMMC). Since night shift is the most problematic shift to assign due to the extra constraints that it has, the paper proposes a combination of semi-cyclic approach, which first allocates a predesigned night shift patterns cyclically, then allocates a combined morning and evening shift patterns in a non-cyclic manner until fulfilling the hard constraints. This is different from our previous work that adopted a non-cyclic shift pattern approach (NCSPA) to construct all of the possible valid shift patterns, which were a combination of morning, evening and night shifts which were incorporated to yield one-week shift patterns. Next, two shift patterns of one-week were allocated for each nurse until construct the initial roster. This paper presents a comparison between the proposed semi-cyclic approach and the previous non-cyclic approach. Beside the minimum violation penalty, we count the number of good patterns that each algorithm produces in order to measure the quality of constructed duty roster. Then, the approach applies simulated annealing algorithm in order to improve the overall produced roster as to enhance the initial roster that resulted from both algorithms. By using a semi-cyclic approach, two benefits over our previous work are gained, (i) the number of constructed shift patterns decreased remarkably, thus reduces the construction time; and (ii) allocating night shift patterns fairly for all nurses becomes more manageable. Based on the obtained results, the semi-cyclic approach yields a better duty roster as it produces more good patterns compared to our previous Non-cyclic approach.

AB - The paper, at hand, introduces a semi-cyclic shift patterns approach (SCSPA) that solves nurse rostering problem (NRP) at the Medical Centre, Universiti Kebangsaan Malaysia (UKMMC). Since night shift is the most problematic shift to assign due to the extra constraints that it has, the paper proposes a combination of semi-cyclic approach, which first allocates a predesigned night shift patterns cyclically, then allocates a combined morning and evening shift patterns in a non-cyclic manner until fulfilling the hard constraints. This is different from our previous work that adopted a non-cyclic shift pattern approach (NCSPA) to construct all of the possible valid shift patterns, which were a combination of morning, evening and night shifts which were incorporated to yield one-week shift patterns. Next, two shift patterns of one-week were allocated for each nurse until construct the initial roster. This paper presents a comparison between the proposed semi-cyclic approach and the previous non-cyclic approach. Beside the minimum violation penalty, we count the number of good patterns that each algorithm produces in order to measure the quality of constructed duty roster. Then, the approach applies simulated annealing algorithm in order to improve the overall produced roster as to enhance the initial roster that resulted from both algorithms. By using a semi-cyclic approach, two benefits over our previous work are gained, (i) the number of constructed shift patterns decreased remarkably, thus reduces the construction time; and (ii) allocating night shift patterns fairly for all nurses becomes more manageable. Based on the obtained results, the semi-cyclic approach yields a better duty roster as it produces more good patterns compared to our previous Non-cyclic approach.

KW - heuristic

KW - Meta-heuristic

KW - Nurses

KW - semi-cyclic

KW - timetabling and scheduling

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

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

U2 - 10.1109/DMO.2011.5976525

DO - 10.1109/DMO.2011.5976525

M3 - Conference contribution

AN - SCOPUS:80055035041

SN - 9781612842127

SP - 184

EP - 189

BT - Conference on Data Mining and Optimization

ER -