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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
