Article ID: | iaor20021093 |
Country: | Germany |
Volume: | 23 |
Issue: | 2 |
Start Page Number: | 283 |
End Page Number: | 294 |
Publication Date: | Jan 2001 |
Journal: | OR Spektrum |
Authors: | Alfares Hesham K. |
An efficient method is presented for the optimum solution of the cyclic manpower days-off scheduling problem. This method, which is based on linear programming, allows unequal costs to be considered for different days-off patterns. First, the solution of the dual linear programming model is used to determine the minimum workforce size. Then, a procedure based on the dual solution is introduced to asssign the workforce to days-off patterns in order to minimize the total labor cost. The new method offers an alternative to specialized linear or integer programming software, since it requires only few and simple calculations.