Abstract
The crew scheduling problem (CSP) involves assigning crew to trains, while satisfying a variety of Federal Railway Administration (FRA) regulations and trade-union work rules. Train crew work together to move a train from its origin to its destination. As the train travels over its route, it goes through numerous crew districts. In each crew district, the train is manned by an engineer and a conductor who are qualified to operate the train within that district. The objectives of crew scheduling are therefore to assign crew to the trains, while minimizing the cost of operating trains, improving crew quality of life, and satisfying all FRA regulations and work rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, NJ
Barnhart C, Johnson EL, Nemhauser GL, Vance PH (2003) Crew scheduling. In: Hall RW (ed) Handbook of transportation science. Kluwer Academic Publisher, Norwell, MA, pp 493–521
Barnhart C, Johnson EL, Anbil R, Hatay L (1994) A column generation technique for the long-haul crew assignment problem. In: Ciriano T, Leachman R (eds) Optimization in industry: volume II. Wiley, England, pp 7–22
Caprara A, Fischetti M, Toth P, Vigo D, Guida PL (1997) Algorithms for railway crew management. Math Program 79:124–141
Chu CK, Chan CH (1998) Crew scheduling of light rail transit in Hong Kong: from modeling to implementation. Comput Oper Res 25:887–894
Freling R, Lentink RM, Wagelmans APM (2004) A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm. Ann Oper Res 127:203–222
Gorman MF, Sarrafzadeh M (2000) An application of dynamic programming to crew balancing at Burlington Northern Santa Fe Railway. Int J Serv Tech Manag 1:174–187
Vaidyanathan B, Jha KC, Ahuja RK (2007) Multicommodity network flow approach to the railroad crew-scheduling problem. IBM J Res Dev 51:325–344
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this chapter
Cite this chapter
Vaidyanathan, B., Ahuja, R.K. (2015). Crew Scheduling Problem. In: Patty, B. (eds) Handbook of Operations Research Applications at Railroads. International Series in Operations Research & Management Science, vol 222. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7571-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7571-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7570-6
Online ISBN: 978-1-4899-7571-3
eBook Packages: Business and EconomicsBusiness and Management (R0)