A heuristic procedure for the crew rostering problem
| Autor: | Salvatore Ricciardelli, Aristide Mingozzi, Maurizio Bielli, Lucio Bianco, Massimo Spadoni |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Linear bottleneck assignment problem
Mathematical optimization Information Systems and Management General Computer Science Management Science and Operations Research Industrial and Manufacturing Engineering Bottleneck Cutting stock problem Modeling and Simulation Combinatorial optimization Settore MAT/09 - Ricerca Operativa Algorithm Assignment problem Integer programming Weapon target assignment problem Generalized assignment problem Mathematics |
| Zdroj: | European Journal of Operational Research. 58:272-283 |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/0377-2217(92)90213-s |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|