We address a problem in air traffic management: scheduling flights in order to minimize the maximum number of aircraft that simultaneously lie within a single air traffic control sector at any time $t$. Since the problem is a generalization of the NP-hard no-wait job-shop scheduling, we resort to heuristics. We report experimental results for real-world flight data.
@InProceedings{kim_et_al:OASIcs.ATMOS.2009.2144, author = {Kim, Joondong and Kroeller, Alexander and Mitchell, Joseph}, title = {{Scheduling Aircraft to Reduce Controller Workload}}, booktitle = {9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-11-8}, ISSN = {2190-6807}, year = {2009}, volume = {12}, editor = {Clausen, Jens and Di Stefano, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2144}, URN = {urn:nbn:de:0030-drops-21443}, doi = {10.4230/OASIcs.ATMOS.2009.2144}, annote = {Keywords: Air Traffic Management, trajectory scheduling, flight plan scheduling, no-wait job shop Air Traffic Management, trajectory scheduling, flight plan scheduling, no-wait job shop} }
Feedback for Dagstuhl Publishing