Solving large scale crew scheduling problems

European Journal of Operational Research

Volumn 97, Issue 2, 1997, Pages 260-268

  Chu, Hai D ^a   Gelman, Eric ^a   Johnson, Ellis L ^b  

^a Research Group   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRANSPORTATION; ALGORITHMS; COST EFFECTIVENESS; GRAPH THEORY; HEURISTIC METHODS; SCHEDULING;

CREW PAIRING; CREW SCHEDULING PROBLEM; GRAPH BASED BRANCHING HEURISTIC; RESTRICTED SET PARTITIONING PROBLEM; SET PARTITIONING ZERO ONE INTEGER PROGRAM;

INTEGER PROGRAMMING;

EID: 0031103502     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00196-8     Document Type: Article

References (4)

1. Anbil, R., Gelman, E., Patty, B., and Tanga, R., "Recent advances in crew-pairing optimization at American Airlines", Interfaces 21/1 (1991) 62-74.
2. Anbil, R., Johnson, E., and Tanga, R., "A global approach to crew-pairing optimization", Research Report #77509, IBM Research Division, 1991.
3. Druckerman, J., Silverman D., and Viaropulos K., "IBM Optimization Subroutine Library", Guide and Reference, Release 2, Document Number SC23-0519-02, IBM, Kingston, NY, 1991.
4. Ryan, D.M., and Falkner, J.C., "A bus crew scheduling system using a set partitioning model", Asia-Pacific Journal of Operational Research 4 (1987) 39-56.