Title :
Evolving engineering mission schedules: a machine-learning approach to scheduling
Author :
Bogess, J.E. ; Mukheeth, Abdul
Author_Institution :
Dept. of Comput. Sci., Mississippi State Univ., MS, USA
Abstract :
Scheduling is frequently a militarily significant procedure. In a battlefield environment, it is often important to have access to rapid scheduling techniques that produce effective and efficient schedules. Standard approaches to scheduling may be ineffective whenever the characteristics of the schedule to be generated-its size, its complexity, interactions among its components, etc.-make it difficult to generate a satisfactory schedule in a reasonable amount of time. In such cases it may be possible to produce near-optimal schedules rapidly through the use of Genetic Algorithms, a sub-symbolic machine learning technique. This approach evolves a schedule probabilistically from a population of schedules, rather than attempting to generate one deterministically. Results obtained in a project to generate mission schedules for U.S. Army engineering units demonstrate that schedules can be evolved relatively rapidly, and that the quality of these schedules is high
Keywords :
data structures; deterministic algorithms; genetic algorithms; learning (artificial intelligence); military computing; processor scheduling; task analysis; 2D matrix; battlefield environment; constraints; crossover; data structure; deterministic approach; evolving engineering mission schedules; genetic algorithms; machine-learning approach; militarily significant procedure; mutation; near-optimal schedules; phenotypes; population of schedules; scheduling; task identification; Blades; Character generation; Computer science; Contracts; Cranes; Genetic algorithms; Humans; Machine learning; NP-hard problem; Processor scheduling;
Conference_Titel :
Aerospace and Electronics Conference, 1997. NAECON 1997., Proceedings of the IEEE 1997 National
Conference_Location :
Dayton, OH
Print_ISBN :
0-7803-3725-5
DOI :
10.1109/NAECON.1997.622724