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: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2000
|
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16993 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-17506 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-175062022-01-04T05:36:48Z Some integer programming formulations of the airline crew-scheduling problem Abacan, Ray Carlo A. Ilagan, Cheryl Lou R. 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. 2000-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16993 Bachelor's Theses English Animo Repository |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| description |
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. |
| format |
text |
| author |
Abacan, Ray Carlo A. Ilagan, Cheryl Lou R. |
| spellingShingle |
Abacan, Ray Carlo A. Ilagan, Cheryl Lou R. Some integer programming formulations of the airline crew-scheduling problem |
| author_facet |
Abacan, Ray Carlo A. Ilagan, Cheryl Lou R. |
| author_sort |
Abacan, Ray Carlo A. |
| title |
Some integer programming formulations of the airline crew-scheduling problem |
| title_short |
Some integer programming formulations of the airline crew-scheduling problem |
| title_full |
Some integer programming formulations of the airline crew-scheduling problem |
| title_fullStr |
Some integer programming formulations of the airline crew-scheduling problem |
| title_full_unstemmed |
Some integer programming formulations of the airline crew-scheduling problem |
| title_sort |
some integer programming formulations of the airline crew-scheduling problem |
| publisher |
Animo Repository |
| publishDate |
2000 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16993 |
| _version_ |
1772835073476788224 |