An Algorithm for the Space-Shuttle Scheduling Problem

Marshall L. Fisher and Ramchandran Jaikumar
Additional contact information
Marshall L. Fisher: University of Pennsylvania, Philadelphia, Pennsylvania
Ramchandran Jaikumar: Booth Fisheries, Chicago, Illinois

Operations Research, 1978, vol. 26, issue 1, 166-182

Abstract: 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.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.166 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:1:p:166-182

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().