Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Introduction to algorithms
Proceedings of the third international conference on Genetic algorithms
Scheduling problems and traveling salesman: the genetic edge recombination
Proceedings of the third international conference on Genetic algorithms
On the k-coloring of intervals
Discrete Applied Mathematics
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
Stochastic heuristic search and evaluation methods for constrained optimization
Stochastic heuristic search and evaluation methods for constrained optimization
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
Management Science
Journal of Artificial Intelligence Research
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Texture-based heuristics for scheduling revisited
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Heuristic-biased stochastic sampling
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Automating Deep Space Network scheduling and conflict resolution
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Leap before you look: an effective strategy in an oversubscribed scheduling problem
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The deep space network scheduling problem
IAAI'05 Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3
Understanding algorithm performance on an oversubscribed scheduling application
Journal of Artificial Intelligence Research
A Lagrangian heuristic for satellite range scheduling with resource constraints
Computers and Operations Research
Evolutionary squeaky wheel optimization: A new framework for analysis
Evolutionary Computation
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
Multi-satellite control resource scheduling based on ant colony optimization
Expert Systems with Applications: An International Journal
Genetic algorithms for satellite scheduling problems
Mobile Information Systems
Hi-index | 0.00 |
We present the first coupled formal and empirical analysis of the Satellite Range Scheduling application. We structure our study as a progression; we start by studying a simplified version of the problem in which only one resource is present. We show that the simplified version of the problem is equivalent to a well-known machine scheduling problem and use this result to prove that Satellite Range Scheduling is NP-complete. We also show that for the one-resource version of the problem, algorithms from the machine scheduling domain outperform a genetic algorithm previously identified as one of the best algorithms for Satellite Range Scheduling. Next, we investigate if these performance results generalize for the problem with multiple resources. We exploit two sources of data: actual request data from the U.S. Air Force Satellite Control Network (AFSCN) circa 1992 and data created by our problem generator, which is designed to produce problems similar to the ones currently solved by AFSCN. Three main results emerge from our empirical study of algorithm performance for multiple-resource problems. First, the performance results obtained for the single-resource version of the problem do not generalize: the algorithms from the machine scheduling domain perform poorly for the multiple-resource problems. Second, a simple heuristic is shown to perform well on the old problems from 1992; however it fails to scale to larger, more complex generated problems. Finally, a genetic algorithm is found to yield the best overall performance on the larger, more difficult problems produced by our generator.