The following optimization problem is considered; airplanes fly on prescribed routes and are flown by crews who must be rested after the passage of a certain interval of flying time. Rested crews who are stationed at bases on the routes can be deployed to keep the planes in flight. For a prescribed number of planes and crews, it is desired to place the crews at bases such that the amount of time spent by the planes in the air is a maximum. This paper investigates the use of a queueing network model as a means of formulating the optimization problem. Upper and lower bounds are presented for the expected fraction of time planes are airborne. These bounds may be useful in solving the optimization problem by means of a simulation model. (Author)
A Queueing Network Approach to a Crew Scheduling Problem
1980
22 pages
Report
No indication
English
Springer Verlag | 2015
|The crew timetabling problem: An extension of the crew scheduling problem
Springer Verlag | 2006
|The crew timetabling problem: An extension of the crew scheduling problem
British Library Conference Proceedings | 2006
|The Operational Airline Crew Scheduling Problem
British Library Online Contents | 1998
|The Operational Airline Crew Scheduling Problem
Online Contents | 1998
|