An integer programming model for hierarchical workforce scheduling problem

Serap Ulusam Seçkiner

doi:10.1016/j.ejor.2006.10.030

Return

An integer programming model for hierarchical workforce scheduling problem

2007-12-01

PRE

Serap Ulusam Seçkiner *

Hadı Gökċen

Mustafa Kurt

DOI：10.1016/j.ejor.2006.10.030

Original

Original request for help

Save

Abstract

En 中文

In this paper, an integer programming model for the hierarchical workforce problem under the compressed workweeks is developed. The model is based on the integer programming formulation developed by Billionnet [A. Billionnet, Integer programming to schedule a hierarchical workforce with variable demands, European Journal of Operational Research 114 (1999) 105-114] for the hierarchical workforce problem. In our model, workers can be assigned to alternative shifts in a day during the course of a week, whereas all workers are assigned to one shift type in Billionnet's model. The main idea of this paper is to use compressed workweeks in order to save worker costs. This case is also suitable for the practice. The proposed model is illustrated on the Billionnet's example problem and the obtained results are compared with the Billionnet's model results. (c) 2006 Elsevier B.V. All rights reserved.

Keywords:

integer programming

personnel

scheduling

hierarchical workforce

compressed workweek

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.