In this paper a system for the automatic generation of shifts with breaks is presented. The problem of generating shifts with breaks appears in many areas of workforce scheduling, like in airline companies, airports, call centers etc. and is of high practical relevance. A heuristics algorithm for solving this problem is described. It is based on greedy assignment of breaks in shifts and repair steps for finding the best position of breaks inside of shifts. The commercial product in which the algorithms are included is used in practice. Computational results for a real life problem in a large European airport are given.
展开▼
