Article ID: | iaor1996441 |
Country: | Netherlands |
Volume: | 58 |
Issue: | 2 |
Start Page Number: | 272 |
End Page Number: | 283 |
Publication Date: | Apr 1992 |
Journal: | European Journal of Operational Research |
Authors: | Bianco Lucio, Ricciardelli Salvatore, Mingozzi Aristide, Bielli Maurizio, Spadoni Massimo |
Keywords: | heuristics, programming: assignment |
This paper deals with the problem of planning work schedules in a given time horizon so as to evenly distribute the workload among the drivers in a mass transit system. An integer programming formulation of this problem is given. An iterative heuristic algorithm is described which makes use of a lower bound derived from the mathematical formulation. Furthermore, the algorithm at each iteration solves a multilevel bottleneck assignment problem for which a new procedure that gives asymptotically optimal solutions is proposed. Computational results for both the rostering problem and the multilevel bottleneck assignment problem are given.