Investigation of fairness measures for nurse rostering

P. Smet, Simon Martin, Djamila Ouelhadj, E. Ozcan, G. Vanden Berghe

Research output: Contribution to conferencePaperpeer-review

190 Downloads (Pure)

Abstract

The nurse rostering problem presents a combinatorial optimisation problem in which shifts must be assigned to nurses who are subject to a large number of workforce related constraints. In the literature on nurse rostering, the fairness of the constructed rosters has often been neglected. Solutions are typically evaluated by means of a weighted sum objective function which does not explicitly account for the fair distribution of individual high quality rosters. The present contribution aims at incorporating fairness measures in existing solution methods for the nurse rostering problem. Preliminary experimental results show that fairer solutions are obtained when applying the new fairness measures.
Original languageEnglish
Publication statusPublished - Feb 2012
EventInternational Conference on the Practice and Theory of Timetabling - , Norway
Duration: 28 Aug 201231 Aug 2012

Conference

ConferenceInternational Conference on the Practice and Theory of Timetabling
Abbreviated titlePATAT 2012
CountryNorway
Period28/08/1231/08/12

Fingerprint

Dive into the research topics of 'Investigation of fairness measures for nurse rostering'. Together they form a unique fingerprint.

Cite this