haku: @author Yan, S. / yhteensä: 5
viite: 3 / 5
| Tekijä: | Yan, S. Tu, Y.-P. |
| Otsikko: | A network model for airline cabin crew scheduling |
| Lehti: | European Journal of Operational Research
2002 : AUG, VOL. 140:3, p. 531-540 |
| Asiasana: | NETWORKS NETWORK ANALYSIS MODELS AIRLINES |
| Kieli: | eng |
| Tiivistelmä: | Airline crew scheduling problems have been traditionally formulated as set covering problems or set partitioning problems. When flight networks are extended, these problems become more complicated and thus more difficult to solve. From the current practices of a Taiwan airline, whose work rules are relatively simple compared to many airlines in other countries, the authors find that pure network models, in addition to traditional set covering (partitioning) problems, can be used to formulate their crew scheduling problems. In this paper, the authors introduce a pure network model that can both efficiently and effectively solve crew scheduling problems for a Taiwan airline using real constraints. The authors perform computational tests concerning the international line operations of a Taiwan airline. |
SCIMA