Title :
Using a Gene-Splicing Based Search Technique for Complex Multi-level Resource Assignment Problems
Author :
Kaslow, David ; Shupp, Jeffrey
Author_Institution :
Integrated Syst. & Global Services, Lockheed Martin, King of Prussia, PA
Abstract :
The phrase "planning and scheduling" represents a class of problems where a resource in limited supply is to be optimally applied. Planning and scheduling problems are accommodated by a branch of mathematics known as operations research. The goal of operations research technology is to find a solution to a known set of conditions such that some minimum "cost" or maximum "profit" is achieved, within some defined constraints. Several algorithms, such as linear programming, dynamic programming, constraint logic programming, have arisen in the past three to four decades to solve particular classes of problems, but real-world problems continue to be extremely difficult to characterize and solve robustly. Therefore, good operations research is still dominated by the ability to transform the real problem into one or more simplified - and solvable - problems without sacrificing too much of the real problem\´s objectives and constraints.
Keywords :
aerospace; genetic algorithms; planning; scheduling; search problems; complex multi-level resource assignment problems; gene splicing based search algorithm; genetic algorithm; multi-level resource management; operations research; planning; scheduling; Costs; Dynamic programming; Earth; Job shop scheduling; Linear programming; Logic programming; Mathematics; Operations research; Resource management; Satellites;
Conference_Titel :
Aerospace Conference, 2008 IEEE
Conference_Location :
Big Sky, MT
Print_ISBN :
978-1-4244-1487-1
Electronic_ISBN :
1095-323X
DOI :
10.1109/AERO.2008.4526652