Document
About this Digital Document
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.
Full Title
An investigation of an implicit enumeration technique using imbedded linear programming to solve the zero one scheduling problem
Member of
Contributor(s)
Creator: Cooperman, Merrick H.
Thesis advisor: Adams, John W.
Publisher
Lehigh University
Date Issued
1970-05
Language
English
Type
Genre
Form
electronic documents
Department name
Industrial Engineering
Digital Format
electronic documents
Media type
Creator role
Graduate Student
Identifier
1048261891
https://asa.lib.lehigh.edu/Record/10947112
Keywords
Cooperman, Merrick H. (1970). An investigation of an implicit enumeration technique using imbedded linear programming to solve the zero one scheduling problem (1–). https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/investigation-16
Cooperman, Merrick H. 1970. “An Investigation of an Implicit Enumeration Technique Using Imbedded Linear Programming to Solve the Zero One Scheduling Problem”. https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/investigation-16.
Cooperman, Merrick H. An Investigation of an Implicit Enumeration Technique Using Imbedded Linear Programming to Solve the Zero One Scheduling Problem. May 1970, https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/investigation-16.
