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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The crew timetabling problem: An extension of the crew scheduling problem


    Contributors:

    Published in:

    Publication date :

    2006-04-01


    Size :

    22 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    The crew timetabling problem: An extension of the crew scheduling problem

    Gomes, M. C. / Cavique, L. s. / Themido, I. | British Library Conference Proceedings | 2006


    Crew Scheduling Problem

    Vaidyanathan, Balachandran / Ahuja, Ravindra K. | Springer Verlag | 2015



    Integrating Timetabling and Crew Scheduling at a Freight Railway Operator

    Bach, Lukas / Dollevoet, Twan / Huisman, Dennis | British Library Online Contents | 2016


    The Operational Airline Crew Scheduling Problem

    Stojkovic, Mirela | Online Contents | 1998