Description 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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applications


    Contributors:
    Dupnick, E. (author)

    Conference:

    Conference on Decision and Control ; 1973 ; San Diego, CA, US


    Publication date :

    1973-01-01


    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English


    Keywords :


    An algorithm for the space shuttle scheduling problem

    Fisher, M. L. / Jaikumar, R. | NTRS | 1975


    A Dynamic Programming Algorithm for Scheduling In-Vehicle Messages

    Hansuk Sohn, / Lee, J.D. / Bricker, D.L. et al. | IEEE | 2008



    Space-Shuttle applications.

    Faget, M. A. / Davis, H. P. | NTRS | 1972