Some integer programming formulations of the airline crew-scheduling problem
This thesis presents some formulations of the Airline Crew Scheduling Problem and their analysis. Airline Crew-Scheduling is one of the most important applications of Set Partitioning Problem, which is a special case of Set Covering Problem. The paper shows the two methods of crew-scheduling: (i) pa...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2000
|
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16993 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This thesis presents some formulations of the Airline Crew Scheduling Problem and their analysis. Airline Crew-Scheduling is one of the most important applications of Set Partitioning Problem, which is a special case of Set Covering Problem.
The paper shows the two methods of crew-scheduling: (i) partitioning the set of flights by a set of pairings, and (ii) partitioning the set of flights by a set of duty periods, then partitioning the set of duty periods by a set of pairings are the same.
The proposition and formulations were taken from the articles of Vance et. al., Airline Crew-Scheduling: A New Decomposition Algorithm . The researchers provided the analysis of the formulations in the problem based on the outputs generated by LINDO. |
|---|