Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-06T10:49:46.380Z Has data issue: false hasContentIssue false

Optimal Scheduling with Maximum Position Shift (MPS)Constraints: A Runway Scheduling Application

Published online by Cambridge University Press:  01 May 1998

Abstract

This paper presents results from a doctoral dissertation (reference 12), on the problem of scheduling with Maximum Position Shift (MPS) constraints. The problem typically arises in a queueing system, when the service rate depends on the sequence in which customers are handled by the server. Such a queueing system is the airport runway system, where it has been shown (references 3, 10, 12) that rearranging the sequence of landings and takeoffs affects the runway capacity – that is, the rate of runway operations. An optimal Dynamic Programming (DP) scheduling algorithm is developed that takes as input the set of currently known flights, their desired time of operation, basis of the First Come First Served (FCFS) sequence, and a matrix of Air Traffic Control (ATC) minimum time separations, in order to produce an optimal schedule defined as runway and threshold time assignments maximizing runway capacity.

Type
Research Article
Copyright
© 1998 The Royal Institute of Navigation

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)