Master of Science
Arthur F. Gould
A computational procedure for the solution of the single stage facility with deadline and earliest start time constraints is presented. The procedure is a modification to the Pierce and Hatfield algorithm for the solution of this type of problem. The aim of the procedure is to reduce the number of nodes that will require evaluation for an optimal solution and thus reduce the total processor running time required to produce this optimal solution.
Rieger, Reuben W., "A computational procedure for the solution of the single-stage production sequencing problem with deadline and earliest start time constraints" (1968). Theses and Dissertations. 3706.