Crew Scheduling Problem

  • Balachandran VaidyanathanEmail author
  • Ravindra K. Ahuja
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 222)


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.


Sink Node Crew Schedule Time Network Train Schedule Supply Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, NJGoogle Scholar
  2. 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–521Google Scholar
  3. 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–22Google Scholar
  4. Caprara A, Fischetti M, Toth P, Vigo D, Guida PL (1997) Algorithms for railway crew management. Math Program 79:124–141Google Scholar
  5. Chu CK, Chan CH (1998) Crew scheduling of light rail transit in Hong Kong: from modeling to implementation. Comput Oper Res 25:887–894CrossRefGoogle Scholar
  6. 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–222CrossRefGoogle Scholar
  7. 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–187CrossRefGoogle Scholar
  8. Vaidyanathan B, Jha KC, Ahuja RK (2007) Multicommodity network flow approach to the railroad crew-scheduling problem. IBM J Res Dev 51:325–344CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.FedEx CorporationMemphisUSA
  2. 2.OptymGainesvilleUSA

Personalised recommendations