Crew Scheduling Problem

Balachandran Vaidyanathan () and Ravindra K. Ahuja ()
Additional contact information
Balachandran Vaidyanathan: FedEx Corporation
Ravindra K. Ahuja: Optym

Chapter Chapter 6 in Handbook of Operations Research Applications at Railroads, 2015, pp 163-175 from Springer

Abstract: 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.

Keywords: Sink Node; Crew Schedule; Time Network; Train Schedule; Supply Node (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:isochp:978-1-4899-7571-3_6

Ordering information: This item can be ordered from
http://www.springer.com/9781489975713

DOI: 10.1007/978-1-4899-7571-3_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().