Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications

The set partitioning model of the crew rotation problem has been well known for many years. This paper focuses on recent developments that have made this model more attractive and have resulted in several successful implementations. These developments include improved problem conceptualizations and decompositions, as well as new solution techniques employing Lagrangian relaxation and subgradient optimization. Experience is reported from The Flying Tiger Line, Pacific Southwest Airways, Continental Airlines, and Helsinki City Transport. A case is made for work on heuristic decomposition methods to break large problems into moderate sized pieces that can be solved exactly.