A network model for airline cabin crew scheduling

European Journal of Operational Research

Volumn 140, Issue 3, 2002, Pages 531-540

  Yan, Shangyao ^a   Tu, Yu Ping ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Airline crew scheduling; Flow decomposition; Network simplex; Pure network problem; Set covering (partitioning) problem

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

AIRLINE CREW SCHEDULING;

OPERATIONS RESEARCH;

EID: 0036680998     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00215-6     Document Type: Article

References (21)

1. Recent advances in crew-pairing optimization at American airlines
2. The airline crew scheduling problem: A survey
3. Network routing
4. Deadhead selection for the long-haul crew pairing problem
5. Branch-and-price: Column generation for solving huge integer programs
6. An approximate model and solution approach for the long-haul crew pairing problem
7. Airline crew scheduling: Supercomputers and algorithms
8. The column generation principle and the airline crew scheduling problem
9. Solving large scale crew scheduling problems
10. Crew pairing at air France
11. Airline scheduling: An overview
12. Optimizing flight crew schedules
13. Flight crew scheduling
14. Solving airline crew-scheduling problem by branch-and-cut
15. A new approach for crew pairing problems by column generation with an application to air transportation
16. The operational airline crew scheduling problem
17. Airline crew scheduling: A new formulation and decomposition algorithm
18. Optimization of airline crew pairings
19. A decision support framework for handling schedule perturbation