We consider the problem of routing incoming airplanes to two runways of an airport. Due to air turbulence, the necessary separation time between two successive landing operations depends on the types of the airplanes. When viewed as a queueing problem, this means that we have dependent service times. The aim is to minimise waiting times of aircrafts. We consider here a model where arrivals form a stochastic process and where the decision maker does not know anything about future arrivals. We formulate this as a problem of stochastic dynamic programming and investigate monotonicity of optimal routing strategies with respect e.g. to the workload of the runways. We show that an optimal strategy is monotone (i.e. of switching type) only in a restricted case where decisions depend on the state of the runways only and not on the type of the arriving aircraft. Surprisingly, in the more realistic case where this type is also known to the decision maker, monotonicity need not hold.


    Access

    Download

    Check availability in my library


    Export, share and cite



    Title :

    Routing of airplanes to two runways: monotonicity of optimal controls


    Contributors:

    Publication date :

    2004



    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    English



    Performances Of Airplanes On Slippery Runways

    Yager, Thomas J. / Baldasare, Paul / Vogler, William A. | NTRS | 1993



    Bituminous runways

    Jackson, G.P. | Engineering Index Backfile | 1961


    Wet runways

    Horne, W. B. | NTRS | 1975


    Wet Runways

    W. B. Horne | NTIS | 1975