A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applicationsDescription of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.
Document ID
19740037363
Acquisition Source
Legacy CDMS
Document Type
Conference Proceedings
Authors
Dupnick, E. (NASA Johnson Space Center Houston, Tex., United States)