Modeling and solving the crew rostering problem

Operations Research

Volumn 46, Issue 6, 1998, Pages 820-830

  Caprara, Alberto ^a   Toth, Paolo ^a   Vigo, Daniele ^a   Fischetti, Matteo ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Networks graphs: matchings; Programming: heuristics, relaxations, applications; Transportation: network models, personnel scheduling, railways

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; PROBLEM SOLVING; REGULATORY COMPLIANCE; SCHEDULING;

CREW ROSTERING PROBLEM; SET COVERING PROBLEM;

OPERATIONS RESEARCH;

EID: 0032202012     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.6.820     Document Type: Article

References (17)

1. AIRO, Ferrovie dello Stato SpA. 1994. Metodi di Ottimizzazione per la Costruzione dei Turni - F.A.R.O. Bando di Concorso (in Italian).
2. AIRO, Ferrovie dello Stato SpA. 1995. Metodi di Ottimizzazione per la Costruzione dei Turni - F.A.R.O. Verbale della Commissione Concorso FARO (in Italian).
3. BALAKRISHNAN, N. AND R. T. WONG. 1990. A Network Model for the Rotating Workforce Scheduling Problem. Networks 20, 25-42.
4. BIANCO, L., M. BIELLI, A. MINGOZZI, S. RICCIARDELLI, AND M. SPADONI. 1992. A Heuristic Procedure for the Crew Rostering Problem. Eur. J. Opnl. Res. 58, 272-283.
5. BODIN, L., B. GOLDEN, A. ASSAD, AND M. BALL. 1983. Routing and Scheduling of Vehicles and Crews: the State of the Art. Computer and Opns. Res. 10, 63-211.
6. BRUNO, G., G. GHIANI, G. IMPROTA, AND M. VENTO. 1995. Un Algoritmo Greedy per la Soluzione del Rostering Problem: Il Caso delle FS. Atti delle Giornate AIRO '95.
7. CAPRARA, A., M. FISCHETTI, AND P. TOTH. 1995. A Heuristic Method for the Set Covering Problem. Technical Report, DEIS, University of Bologna, to appear in Opns. Res.
8. CARPANETO, G. AND P. TOTH. 1987. Primal-Dual Algorithms for the Assignment Problem. Discrete Appl. Math. 18, 137-153.
9. CARRARESI, P. AND G. GALLO. 1984. A Multilevel Bottleneck Assignment Approach to the Bus Drivers' Rostering Problem. Eur. J. Opnl. Res. 16, 163-173.
10. GAMACHE, M. AND F. SOUMIS. 1993. A Method for Optimally Solving the Rostering Problem. Les Cahiers du GERAD, G-93-40. Montréal.
11. GAMACHE, M., F. SOUMIS, G. MARQUIS, AND J. DESROSIERS. 1994. A Column Generation Approach for Large Scale Aircrew Rostering Problems. Cahiers du GERAD, G-94-20. Montrèal.
12. HAGBERG, B. 1985. An Assignment Approach to the Roster: ing Problem. In Computer Scheduling of Public Transport 2, J. M. Rousseau (ed.). North Holland.
13. JARRAH, A. I. Z. AND J. T. DIAMOND. 1995. The Crew Bidline Generation Problem. Technical Report. SABRE Decision Technologies.
14. JACHNIK, J. K. 1981. Attendance and Rostering Systems. In Computer Scheduling of Public Transport, A. Wren (ed.) North Holland.
15. RYAN, D. M. 1992. The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering. J. Opnl. Res. Soc. 43, 459-467.
16. TADEI, R., C. ALFIERI, P. BARACCO, F. DELLA CROCE, F. RIZZANTE, AND M. SBODIO. 1995. Un Algoritmo Genetico per il Problema di Rostering. Atti delle Giornate, AIRO '95.
17. TIEN, J. M. AND A. KAMIYAMA. 1982. On Manpower Scheduling Algorithms. SIAM Rev. 24, 275-287.