Citation
Optimisation of Staff Absences. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 360-369, 2015.
Paper
Abstract
Most timetabling problems to date focus on the presence of employees like nurses or teachers or, in general, resources like rooms or classes. Although, for example, in nurse rostering attention is paid to time intervals in which nurses are on a holiday, it seems that – to the best of our knowledge–no fundamental approach to pure absence planning exists. In order to ?ll this gap, we introduce a novel approach to staff absence optimisation through leave request approval or rejection: the Absence Scheduling Problem (ASP). Using the Erlangen Advanced Time Tabling Software (EATTS) framework we implemented a very ?exible absence request model that includes alternatives to ?rst choice requests, multiple periods for a single request, and sophisticated possibilities to specify the requested time slots within each period. In this paper we describe our data model and the corresponding problem constraints, like ful?lling minimal staff or absence quota conditions, including a mathematical model for both. Additionally, we compare the performance of Tabu Search (TS) and Simulated Annealing (SA) paired with two different move pools, one of them including repair moves, on the ASP. For this purpose, we ?rst describe our test data generator and present test results for problem sizes of 100 and 250 employees afterwards. We show that the ‘advanced’ move pool with repair moves on the one hand helps TS to ?nd slightly better solutions but, on the other hand, actually hinders SA’s optimisation process for the smaller problem size while having a positive effect for the 250 employees problem.
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{2015-360-369-P, author = {C. Kl{\"o}cker and J. Ostler and P. Wilke},
title = {Optimisation of Staff Absences},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {360--369},
note = {Paper},
abstract = {Most timetabling problems to date focus on the presence of employees like nurses or teachers or, in general, resources like rooms or classes. Although, for example, in nurse rostering attention is paid to time intervals in which nurses are on a holiday, it seems that – to the best of our knowledge–no fundamental approach to pure absence planning exists. In order to ?ll this gap, we introduce a novel approach to staff absence optimisation through leave request approval or rejection: the Absence Scheduling Problem (ASP). Using the Erlangen Advanced Time Tabling Software (EATTS) framework we implemented a very ?exible absence request model that includes alternatives to ?rst choice requests, multiple periods for a single request, and sophisticated possibilities to specify the requested time slots within each period. In this paper we describe our data model and the corresponding problem constraints, like ful?lling minimal staff or absence quota conditions, including a mathematical model for both. Additionally, we compare the performance of Tabu Search (TS) and Simulated Annealing (SA) paired with two different move pools, one of them including repair moves, on the ASP. For this purpose, we ?rst describe our test data generator and present test results for problem sizes of 100 and 250 employees afterwards. We show that the ‘advanced’ move pool with repair moves on the one hand helps TS to ?nd slightly better solutions but, on the other hand, actually hinders SA’s optimisation process for the smaller problem size while having a positive effect for the 250 employees problem.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-360-369-P.pdf} }