ROUTING OF AIRPLANES TO TWO RUNWAYS: MONOTONICITY OF OPTIMAL CONTROLS
- 1 October 2004
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 18 (4), 533-560
- https://doi.org/10.1017/s0269964804184088
Abstract
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 type of airplane. When viewed as a queuing problem, this means that we have dependent service times. The aim is to minimize the waiting times of aircrafts. We consider here a model in which arrivals form a stochastic process and the decision-maker does not know anything about future arrivals. We formulate this as a problem of stochastic dynamic programming and investigate the monotonicity of optimal routing strategies with respect to the workload of the runways, for example. 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.Keywords
This publication has 5 references indexed in Scilit:
- Scheduling Aircraft Landings—The Static CaseTransportation Science, 2000
- Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed informationQueueing Systems, 1995
- A survey of Markov decision models for control of networks of queuesQueueing Systems, 1993
- Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service timesAdvances in Applied Probability, 1977
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimalProbability Theory and Related Fields, 1975