Mixed integer programming to schedule a single-shift workforce under annualized hours

Nowadays flexibility is a strategic concept for firms. Indeed workload has to follow, as close as possible, the development of demand throughout the year. However, firms cannot engage and dismiss employees according to production requirements. Thus, workforce scheduling becomes a delicate task. In this paper, four mixed integer programming models are developed to solve the workforce schedule problem for a single- shift. The annualized hour scenario is considered with respect to a set of Swiss legal constrains. Furthermore, the minimal required workforce is guaranteed and it is assumed that each employee is able to perform each task within the team. All employees are full- time workers.