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

Marta Gomes (), Luís Cavique () and Isabel Themido

Annals of Operations Research, 2006, vol. 144, issue 1, 132 pages

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. Copyright Springer Science+Business Media, LLC 2006

Keywords: Crew scheduling; Cover crews; Resource levelling; Multigraph; Tabu search (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-0017-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:144:y:2006:i:1:p:111-132:10.1007/s10479-006-0017-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-0017-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().