๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristic and exact algorithms for scheduling aircraft landings

โœ Scribed by Ernst, Andreas T.; Krishnamoorthy, Mohan; Storer, Robert H.

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
116 KB
Volume
34
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways in such a way that separation criteria between all pairs of planes (not just successive ones) are satisfied. Each plane has an allowable time window as well as a target time. There are costs associated with landing either earlier or later than this target landing time. In this paper, we present a specialized simplex algorithm which evaluates the landing times very rapidly, based on some partial ordering information. This method is then used in a problem space search heuristic as well as a branch-and-bound method for both singleand multiple-runway problems. The effectiveness of our algorithms is tested using some standard test problems from the literature.

๐Ÿ“œ SIMILAR VOLUMES

Project scheduling with multiple modes:
Project scheduling with multiple modes: A comparison of exact algorithms
โœ Hartmann, S๏ฟฝnke; Drexl, Andreas ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB

This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple execution modes for each activity. After summarizing the two exact algorithms that have been suggested in the literature, we

Class scheduling algorithms for Navy tra
Class scheduling algorithms for Navy training schools
โœ A. Apte; A. Jayasuriya; J. Kennington; I. Krass; R. Mohamed; S. Sorensen; J. Whi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB

The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline schedul

Heuristic procedures for scheduling job
Heuristic procedures for scheduling job families with setups and due dates
โœ Kenneth R. Baker ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 261 KB

This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in g