On the waiting time of arriving aircrafts and the capacity of airports with one or two runways. (English) Zbl 1110.90017
Summary: We examine a model for the landing procedure of aircrafts at an airport. The characteristic feature here is that due to air turbulence the safety distance between two landing aircrafts depends on the types of these two machines. Hence, an efficient routing of the aircraft to two runways may reduce their waiting time.First, we use \(M/SM/1\) queues (with dependent service times) to model a single runway. We give the stability condition and a formula for the average waiting time of the aircrafts. Moreover, we derive easy to compute bounds on the waiting times by comparison to simpler queuing systems. In particular we study the effect of neglecting the dependency of the service times when using \(M/G/1\)-models.We then consider the case of two runways with a number of heuristic routing strategies such as coin flipping, type splitting, Round Robin and variants of the join-the-least-load rule. These strategies are analyzed and compared numerically with respect to the average delay they cause. It turns out that a certain modification of join-the-least-load gives the best results.
MSC:
| 90B22 | Queues and service in operations research |
| 90B20 | Traffic problems in operations research |
| 90C59 | Approximation methods and heuristics in mathematical programming |
References:
| [1] | Bäuerle, N.; Engelhardt-Funke, O.; Kolonko, M., Routing of aircrafts to two runways: Monotonicity of optimal controls, Probability in the Engineering and Informational Sciences, 18, 533-560 (2004) · Zbl 1063.90036 |
| [2] | Bäuerle, N.; Rieder, U., Comparison results for Markov-modulated recursive models, Probability in the Engineering and Informational Sciences, 11, 203-217 (1997) · Zbl 1096.60518 |
| [3] | Beasley, J. E.; Krishnamoorty, M.; Sharaiha, Y. M.; Abramson, D., Scheduling aircraft landings - The static case, Transportation Science, 34, 180-197 (2000) · Zbl 1004.90511 |
| [4] | J.E. Beasley, M. Krishnamoorty, Y.M. Sharaiha, D. Abramson, The displacement problem and dynamically scheduling aircraft landings. Available from: <http://mscmga.ms.ic.ac.uk/jeb/jeb.html; J.E. Beasley, M. Krishnamoorty, Y.M. Sharaiha, D. Abramson, The displacement problem and dynamically scheduling aircraft landings. Available from: <http://mscmga.ms.ic.ac.uk/jeb/jeb.html |
| [5] | Bolender, M. A.; Slater, G. L., Evaluation of scheduling methods for multiple runways, Journal of Aircrafts, 37, 410-416 (2000) |
| [6] | Çinlar, E., Time dependence of queues with semi-Markovian services, Journal of Applied Probability, 4, 356-364 (1967) · Zbl 0153.19904 |
| [7] | Ephremides, A.; Varaya, P.; Walrand, J., A simple dynamic routing problem, IEEE Transactions on Automatic Control, AC-25, 690-693 (1980) · Zbl 0451.90060 |
| [8] | Horonjeff, R.; McKelvey, F. X., Planning and Design of Airports (1994), McGraw-Hill: McGraw-Hill Boston |
| [9] | Loynes, R. M., The stability of a queue with non-independent inter-arrival and service times, Proceedings of the Cambridge Philosophical Society, 58, 497-520 (1962) · Zbl 0203.22303 |
| [10] | Neuts, M. F., The single server queue with Poisson input and semi-Markov service times, Journal of Applied Probability, 3, 202-230 (1966) · Zbl 0204.20003 |
| [11] | Neuts, M. F., Moment formulas for the Markov renewal branching process, Advances in Applied Probability, 8, 690-711 (1976) · Zbl 0379.60081 |
| [12] | Neuts, M. F., Some explicit formulas for the steady-state behaviour of the queue with semi-Markovian service times, Advances in Applied Probability, 9, 141-157 (1977) · Zbl 0381.60081 |
| [13] | Neuts, M. F., Structured Stochastic Matrices of M/G/1 Type and their Applications (1989), Marcel Dekker: Marcel Dekker New York and Basel · Zbl 0683.60067 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
