An Algorithm for the Space-Shuttle Scheduling Problem

The mission scheduling problem of the NASA space-shuttle program requires a selection of mission launch times that minimize the number of missions flown late and that satisfy early start time and resource constraints. We present an algorithm for this problem that is easy to program, requires little computation and, under certain restrictive assumptions, provides an optimal solution. Computational experience with a test case is discussed.