Space Station payload scheduling

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.