Harmonious personnel scheduling

Abstract

The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how Ortec Harmony handles this planning problem. In particular we go into the structure of the opti-mization engine in Ortec Harmony, which uses techniques from genetic algorithms, local optimization algo-rithms and variable neighborhood search. We will describe the result on an artificial test set.