Date of Award

Fall 1959

Degree Type

Thesis - Restricted

Degree Name

Master of Science (MS)

Department

Mathematics

First Advisor

Heider, L. J.

Second Advisor

Hanneken, C. B.

Abstract

The "job shop" is an important part of many of today's industrial organizations. In general, a job shop is composed of a set of facilities or machines and a set of jobs which are to be processed on the various machines. The distinguishing feature of a job shop is the fact that the sequence of machine operations required by anyone job is independent of the sequence required by any other job . As a result there may be considerable competition amongst the jobs for the use of the machines. This quite naturally leads to questions of how best to order the jobs on the machines according to certain criteria. One criterion which has received some attention is that of minimizing the over-all time to do all jobs. In this paper a new approach to the problem is developed.

Share

COinS