Combinatorial optimization techniques for spacecraft scheduling automation
From MaRDI portal
Publication:1339156
DOI10.1007/BF02085657zbMath0812.90108MaRDI QIDQ1339156
Frank Rotman, William T. Scherer
Publication date: 1 December 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
simulated annealingtabu searchsequencingrandom searchstrategic oscillationautomatic spacecraft schedulingrandom hill climbing
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items
Metaheuristics: A bibliography ⋮ Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
Uses Software
Cites Work
- Tabu search for large scale timetabling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- Maximizing the value of a space mission
- Tabu search for a class of scheduling problems
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item