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

DOI10.1007/S10479-006-0017-8MaRDI QIDQ867544zbMATH OpenOpenAlexFDO

Authors Marta Castilho Gomes, Luís Cavique, Isabel Themido

Publication date 15 February 2007

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10400.2/1953

zbMATH Keywords

cover crewscrew schedulingmultigraphresource levellingtabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1488070
• scientific article; zbMATH DE number 3950190
• Vehicle and crew scheduling with flexible timetable
• Algorithms for railway crew management
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem

Cites work

• Computer-aided transit scheduling. Proceedings of the 6th international workshop on computer-aided scheduling of public transport, Lisbon, Portugal, July 6-9, 1993
• Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987
• scientific article; zbMATH DE number 3744893 (Why is no real title available?)
• scientific article; zbMATH DE number 49342 (Why is no real title available?)
• scientific article; zbMATH DE number 483383 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Optimal resource leveling using non-serial dynamic programming
• Resource levelling for projects with schedule-dependent time windows
• Subgraph ejection chains and tabu search for the crew scheduling problem
• The crew timetabling problem: an extension of the crew scheduling problem

Cited in

(8)

• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• Subgraph ejection chains and tabu search for the crew scheduling problem
• scientific article; zbMATH DE number 1070503 (Why is no real title available?)
• scientific article; zbMATH DE number 1488070 (Why is no real title available?)
• scientific article; zbMATH DE number 915586 (Why is no real title available?)
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
• A Multicommodity Flow Approach to the Crew Rostering Problem
• The crew timetabling problem: an extension of the crew scheduling problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: The crew timetabling problem: an extension of the crew scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867544)