Interactive Anticipatory Scheduling for Two Military Applications

摘要

Application of scheduling technologies lags significantly behind the state-of-the-art. This project investigated two contributors to this lag. First, researchers do not know what makes particular problems difficult for their methods. Second, researchers often develop methods in isolation from actual data and applications. To address the first, new static and the first dynamic models of local search algorithms have been developed; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data. Additionally, a prototype interactive scheduler has been built that includes the algorithm and objective functions.