#TITLE_ALTERNATIVE#
Airline crew scheduling is performed in two steps : construction of a minimum pairing's set and crew rostering problem. Pairing is a work schedule, consisting of a series of fights operated by one or more sets of crew starting from homebase in the first fight until return to homebase in the las...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/13929 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Airline crew scheduling is performed in two steps : construction of a minimum pairing's set and crew rostering problem. Pairing is a work schedule, consisting of a series of fights operated by one or more sets of crew starting from homebase in the first fight until return to homebase in the last fight. The set of pairing must be determined before finding the minimum set of pairing. In this final project, the algorithm for constructing the set of possible pairing in Elsa Pitriana's final project will be revisit. A new algorithm proposed, in which its first step is explore routes that are possible to be pairings. A pairing will be constructed by testing a route will satisfy crew's work rules or not. Using this algoritm, the set of pairing can be constructed efficiently. |
|---|