A memetic algorithm to maximise the employee substitutability in personnel shift scheduling

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Personnel rosters are typically constructed for a medium- term period under the assumption of a deterministic operating environment. However, organisations usually operate in a stochastic environment and are confronted with unexpected events in the short term. These unexpected events affect the workability of the personnel roster and need to be resolved efficiently and effectively. To facilitate this short-term recovery, it is important to consider robustness by adopting proactive scheduling strategies during the roster construction. In this paper, we discuss a proactive strategy that maximises the employee substitutability value in a personnel shift scheduling context. We propose a problem-specific population-based approach with local and evolutionary search heuristics to solve the resulting non-linear personnel shift scheduling problem and obtain a medium-term personnel shift roster with a maximised employee substitutability value. Detailed computational experiments are presented to validate the design of our heuristic procedure and the selection of the heuristic operators.

Cite

CITATION STYLE

APA

Ingels, J., & Maenhout, B. (2017). A memetic algorithm to maximise the employee substitutability in personnel shift scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10197 LNCS, pp. 44–59). Springer Verlag. https://doi.org/10.1007/978-3-319-55453-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free