Mathematical Programming and Optimal Crew Rostering

Lin Xie ()
Additional contact information
Lin Xie: Universität Paderborn

Chapter 5 in Decision Support for Crew Rostering in Public Transit, 2015, pp 41-55 from Springer

Abstract: Abstract We first describe the network used for solving the crew rostering problem in Section 5.1. We have the same network design for the rota scheduling problem (a sub-problem of the crew rostering problem) as for the integrated problem, for both CCR and NCCR problems. Based on the network, an overview of the mathematical formulations for solving the decomposed and integrated NCCR problems will be given in Section 5.2. A small modification of the models is then presented in Section 5.3 for solving the CCR problems. A description of real-world instances, along with the results, will be presented in Chapter 6.

Date: 2015
References: Add references at CitEc
Citations:

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:sprchp:978-3-658-08167-6_5

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

DOI: 10.1007/978-3-658-08167-6_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().