Heuristic methods for an aircraft landing scheduling problem

摘要

A problem is considered for scheduling optimally aircraft landings at an airport. The landing time for each aircraft should be determined in such a way that each aircraft lands within a predetermined time window and that a definite separation time must be assigned between two successive aircrafts. Two heuristic methods are proposed for this problem. Computational results are shown for several test problems, and a comparison is made among two heuristic methods and Beasley's method.