Airline crew scheduling under uncertainty

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.