ALGORITHM FOR SPACE-SHUTTLE SCHEDULING PROBLEM

被引:7
作者
FISHER, ML [1 ]
JAIKUMAR, R [1 ]
机构
[1] BOOTH FISHERIES,CHICAGO,IL
关键词
D O I
10.1287/opre.26.1.166
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. The authors 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.
引用
收藏
页码:166 / 182
页数:17
相关论文
共 3 条
[1]  
LENSTRA JK, 1976, THESIS AMSTERDAM
[2]   N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS [J].
MOORE, JM .
MANAGEMENT SCIENCE, 1968, 15 (01) :102-109
[3]  
RINNOOYKAN AHG, 1976, THESIS LEIDEN