Master of Science
John W. Adams
A computational procedure for obtaining the minimum makespan solution for scheduling N jobs through M machines with job start constraints, due date constraints, and job passing allowed is investigated concerning the method of bringing jobs into solution.
Cooperman, Merrick H., "An investigation of an implicit enumeration technique using imbedded linear programming to solve the zero one scheduling problem" (1970). Theses and Dissertations. 3861.