AAAI Publications, Sixth European Conference on Planning

Font Size: 
The Operational Traffic Control Problem: Computational Complexity and Solutions
Wolfgang Hatzack, Bernhard Nebel

Last modified: 2014-05-21


The operational traffic control problem comes up in a number of different contexts. It involves the coordinated movement of a set of vehicles and has by and large the flavor of a scheduling problem. In trying to apply scheduling techniques to the problem, one notes that this is a job-shop scheduling problem with blocking, a type of scheduling problem that is quite unusual. In particular, we will highlight a condition necessary to guarantee that job-shop schedules can be executed in the presences of the blocking constraint. Based on the insight that the traffic problem is a scheduling problem, we can derive the computational complexity of the operational traffic control problem and can design some algorithms to deal with this problem. In particular, we will specify a very simple method that works well in fast-time simulation contexts.


Airport, Scheduling, Operational Traffic Problem, Search

Full Text: PDF