Date

1970

Document Type

Thesis

Degree

Master of Science

Department

Industrial Engineering

First Adviser

John W. Adams

Abstract

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.

Share

COinS