A solution algorithm is presented for the scheduling of payloads for NASA's proposed Space Station. The payload scheduling problem possesses some unique and unusual features that cannot be adequately addressed using static scheduling theory. The solution algorithm is demonstrated with a hypothetical Space Station example that involves 10 payloads and 3 crewmembers with a varied skill profile. A constrained version of the algorithm is compared with three other scheduling heuristics through use of the Space Station Operations Model which can simulate orbital activities. The constrained solution algorithm outperforms the three other scheduling heuristics in the minimization of makespan.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Space Station payload scheduling


    Contributors:

    Publication date :

    1990-01-01


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English




    Space station payload operations scheduling with ESP2

    Stacy, Kenneth L. / Jaap, John P. | NTRS | 1988



    Space Station payload accommodations

    Hemmerdinger, Louis / Holt, Alan | NTRS | 1988


    Space Station Payload Accommodation

    Aepli, T. C. / Alvarado, U. R. | IEEE | 1987


    International Space Station Payload Accommodations

    Hartman, D. W. / University of New Mexico; School of Engineering; Institute for Space and Nuclear Power Studies | British Library Conference Proceedings | 1999