الفهرس 
Integrated planning of aircraft routing and crew scheduling
SummaryOnly 14 pages are availabe for public view
 |  | from | 137 |  |  |
| | | from | 137 | | |
Abstract
The solution process iterates between a master problem that solves the aircraft routing problem, and a sub-problem that solves the crew pairing problem. This technique reduces computing time and eases the linkage procedure between the two problems and at first achieving sub-optimal non-integer results and then a branch and bound algorithm is performed to get the optimal integer solutions