Show simple item record

dc.contributor.authorMaenhout, Broos
dc.contributor.authorVanhoucke, Mario
dc.date.accessioned2018-04-12T12:19:00Z
dc.date.available2018-04-12T12:19:00Z
dc.date.issued2018
dc.identifier.issn0377-2217
dc.identifier.doi10.1016/j.ejor.2018.03.005
dc.identifier.urihttp://hdl.handle.net/20.500.12127/5939
dc.description.abstractIn this paper, we propose a heuristic optimisation procedure for the integrated personnel shift and task re-scheduling problem. We assume that schedule disruptions arise as the baseline personnel roster is subject to three sources of operational variability, i.e. uncertainty of capacity, uncertainty of demand and uncertainty of arrival. In order to restore the feasibility of the personnel roster and to minimise the number of deviations compared to the original roster, we propose a heuristic re-scheduling procedure that thrives on a perturbation mechanism to diversify the search and a variable neighbourhood search to intensify the search in the region of a solution point. In the computational experiments, we assess the contribution of the different algorithmic building blocks and benchmark our algorithm with other optimisation procedures.
dc.language.isoen
dc.publisherElsevier
dc.subjectPersonnel Scheduling
dc.subjectHeuristic Optimisation
dc.subjectRe-rostering
dc.titleA perturbation matheuristic for the integrated personnel shift and task rescheduling problem
dc.identifier.journalEuropean Journal of Operational Research
dc.source.volume269
dc.source.issue3
dc.source.beginpage806
dc.source.endpage823
dc.contributor.departmentGhent University
dc.contributor.departmentUCL School of Management, University College London
vlerick.typearticleVlerick strategic journal article
vlerick.vlerickdepartmentTOM
dc.identifier.vperid58614


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record