Citation

Messelis, T; Causmaecker, P. D and Berghe, G.Van de Algorithm preformance prediction for nurse rostering. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 21-38, 2013.

Paper


Abstract

In this paper, we investigate accurate performance prediction models for nurse rostering algorithms. The study is based on results of a similar approach for formally stated decision problems. Due to the complex nature of nurse rostering problems, we are bound to useheuristicmethodsthatdelivergoodsolutionsinareasonableamountoftime.Thereisno guaranteeofsolutionsbeingoptimal.Inpractice,itisnotevenpossibletoemployexhaustive searchmethodsonrealisticprobleminstances.Wequantifytheperformanceofanalgorithm as the quality of the obtained solution, after a predetermined amount of computation time. Webuildpredictionmodelsbasedonsimplecharacteristicsoftheinstances.Wedevelop a feature set that characterises the instances in terms of simple values. Such an approach allowsforfastandaccuratepredictions.Theapplicationofthemethodologytonurserostering has not been attempted before.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{2013-021-038-P, author = {T. Messelis and P. De Causmaecker and G.Van den Berghe},
title = {Algorithm preformance prediction for nurse rostering},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {21--38},
note = {Paper},
abstract = { In this paper, we investigate accurate performance prediction models for nurse rostering algorithms. The study is based on results of a similar approach for formally stated decision problems. Due to the complex nature of nurse rostering problems, we are bound to useheuristicmethodsthatdelivergoodsolutionsinareasonableamountoftime.Thereisno guaranteeofsolutionsbeingoptimal.Inpractice,itisnotevenpossibletoemployexhaustive searchmethodsonrealisticprobleminstances.Wequantifytheperformanceofanalgorithm as the quality of the obtained solution, after a predetermined amount of computation time. Webuildpredictionmodelsbasedonsimplecharacteristicsoftheinstances.Wedevelop a feature set that characterises the instances in terms of simple values. Such an approach allowsforfastandaccuratepredictions.Theapplicationofthemethodologytonurserostering has not been attempted before.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-021-038-P.pdf} }