Proceedings of the third international conference on Genetic algorithms
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
Management Science
Journal of Artificial Intelligence Research
Maximizing flexibility: a retraction heuristic for oversubscribed scheduling problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Combining genetic algorithms with squeaky-wheel optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Improving genetic algorithm performance with intelligent mappings from chromosomes to solutions
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Automating Deep Space Network scheduling and conflict resolution
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Simulation-based planning for planetary rover experiments
WSC '05 Proceedings of the 37th conference on Winter simulation
Robust resource allocation in a massive multiplayer online gaming environment
Proceedings of the 4th International Conference on Foundations of Digital Games
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
Mixed discrete and continuous algorithms for scheduling airborne astronomy observations
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satellite Control Network scheduling, we find that the best approaches make long leaps in the search space. We find this is in part due to large plateaus in the search space. Algorithms moving only one task at a time are impractical. Both a genetic algorithm and Squeaky Wheel Optimization (SWO) make long leaps in the search space and produce good solutions almost 100 times faster than local search. Greedy initialization is shown to be critical to good performance, but is not as important as directed leaps. When using fewer than 2000 evaluations, SWO shows superior performance; with 8000 evaluations, a genetic algorithm using a population seeded with greedy solutions further improves on the SWO results.