Air transportation simulation: SimAir: a stochastic model of airline operations
Proceedings of the 32nd conference on Winter simulation
A dynamic driver management scheme for less-than-truckload carriers
Computers and Operations Research
Robust crew pairing for managing extra flights
Computers and Operations Research
Integrated Airline Fleet and Crew Robust Planning
Transportation Science
Disruption management in the airline industry-Concepts, models and methods
Computers and Operations Research
A multi-objective approach for robust airline scheduling
Computers and Operations Research
An iterative approach to robust and integrated aircraft routing and crew scheduling
Computers and Operations Research
Constraint-specific recovery network for solving airline recovery problems
Computers and Operations Research
Solving a robust airline crew pairing problem with column generation
Computers and Operations Research
Vessel routing and scheduling under uncertainty in the liquefied natural gas business
Computers and Industrial Engineering
Dynamic Assignment of Crew Reserve in Airlines
International Journal of Applied Metaheuristic Computing
Hi-index | 0.00 |
Airline crew scheduling algorithms widely used in practice assume no disruptions. Because disruptions often occur, the actual cost of the resulting crew schedules is often greater. We consider algorithms for finding crew schedules that perform well in practice. The deterministic crew scheduling model is an approximation of crew scheduling under uncertainty with the assumption that all pairings will operate as planned. We seek better approximate solution methods for crew scheduling under uncertainty that still remain tractable. We give computational results from three fleets that indicate that the crew schedules obtained from our method perform better in a model of operations with disruptions than the crew schedules found via deterministic methods. Under mild assumptions we provide a lower bound on the cost of an optimal crew schedule in operations, and we demonstrate that some of the crew schedules found using our method perform very well relative to this lower bound.