Paper Info
Title
A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling.
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.
Year
DOI
Venue
2017
10.1007/978-3-319-55453-2_4
Lecture Notes in Computer Science
Keywords
Field
DocType
Personnel shift scheduling,Employee substitutability,Memetic algorithm
Memetic algorithm,Population,Operating environment,Heuristic,Job shop scheduling,Computer science,Scheduling (computing),Operations research,Heuristics,Unexpected events,Management science,Distributed computing
Conference
Volume
ISSN
Citations 
10197
0302-9743
1
PageRank 
References 
Authors
0.37
21
2
Name
Order
Citations
PageRank
Jonas Ingels151.47
Broos Maenhout220713.69