Abstract
In some urban transportation companies driving periods are short when compared with the total duty time, leading to long non-driving periods that can be used as cover time. This paper presents the Crew Timetabling Problem, an extension of the Crew Scheduling Problem in which crew timetables are obtained by levelling the cover crew resources. An objective function for this problem is proposed in order to balance the number of driving and cover crews. A Lisbon Underground case study is used to illustrate the Crew Timetabling Problem. The problem is represented in a multigraph and solved by a tabu search-based heuristic.
Similar content being viewed by others
References
Bandelloni, M., M. Tucci, and R. Rinaldi. (1994). “Optimal Resource Levelling Using Non-Serial Dynamic Programming.” European Journal of Operational Research 78, 162–177.
Bodin, L. and D. Berman (eds.). (1975). “Workshop on Automated Techniques for Scheduling of Vehicles Operator for Urban Transportation Services.” Pre-print.
Cavique, L., C. Rego, and I. Themido. (1999). “Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem.” Journal of the Operational Research Society 50, 608–616.
Daduna, J. and A. Wren (eds.) (1988). Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Daduna, J., I. Branco, and J. Paixão (eds.) (1995). Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Desrochers, M. and J.-M. Rousseau (eds.) (1992). Proceedings of the Fifth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Glover, F. (1995). “Tabu Search Fundamentals and Uses.” Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder.
Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers.
Gomes, M.C., L. Cavique, and I. Themido. (2002). “An Algorithmic Approach for the Crew Timetabling Problem.” Technical Report, CESUR—Instituto Superior Técnico.
Hartley, T. (1981). “A Glossary of Terms in Bus and Crew Scheduling.” In: Computer Scheduling of Public Transport. Urban Passenger Vehicle and Crew Scheduling, A. Wren (ed.), North-Holland, pp. 353–359.
Neumann, K. and J. Zimmermann. (1999). “Resource Levelling for Projects with Schedule-Dependent Time Windows.” European Journal of Operational Research 117, 591–605.
Rousseau, J.-M. (ed.). (1985). Computer Scheduling of Public Transport 2. North-Holland.
Wilson, N. (ed.) (1999). Proceedings of the Seventh International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Wilson, R.J. and J.J. Watkins. (1990). Graphs—An Introductory Approach. John Wiley & Sons.
Wren, A. (ed.) (1981). Computer Scheduling of Public Transport. Urban Passenger Vehicle and Crew Scheduling. North-Holland.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gomes, M.C., Cavique, L. & Themido, I. The crew timetabling problem: An extension of the crew scheduling problem. Ann Oper Res 144, 111–132 (2006). https://doi.org/10.1007/s10479-006-0017-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0017-8