The problem of airline crew scheduling is studied, the different problems composing it are formulated and solution techniques are offered. Special emphasis is given to the set covering problem appearing in the rotation selection phase. An approach is presented, based on the group theoretic method, which allows the fast solution of problems with large sizes
Airline crew scheduling : a group theoretic approach.
Set covering problems solved by group theory computational experience
1969
[6], 108 p
Also issued as a Ph. D. thesis in the Dept. of Civil Engineering, Massachusetts Institute of Technology, 1970
October 1969
Includes a [4] p. FTL memo no. M69-3, dated December 1969 with title: Set covering problems solved by group theory computational experience, by Herve Thiriez
Errata inserted after title-page
Includes bibliographical references (p. 105-108)
Report
Electronic Resource
Unknown
Airline Crew Scheduling Under Uncertainty
Online Contents | 2005
|Airline Crew Scheduling Under Uncertainty
British Library Online Contents | 2005
|Airline Crew Scheduling with Regularity
British Library Online Contents | 2001
|Airline Crew Scheduling with Regularity
Online Contents | 2001
|