Accession Number : AD0721544

Title :   Approaches to the N-Job M-Machine Scheduling Problem.

Descriptive Note : Master's thesis,

Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF

Personal Author(s) : Shackelton,Norman John , Jr

Report Date : MAR 1971

Pagination or Media Count : 47

Abstract : The thesis presents two methods of solving the n-job m-machine job shop scheduling problem. The criterion for optimality is the minimization of the total time to process all jobs on all machines. The technological ordering of machines for each job is fixed, known, and nonrandom. The first method presented, a graphical method, indicates a lower bound and an upper bound on the optimal time to process all jobs on all machines. The second method is a branch and bound algorithm. In principle an optimal solution can always be determined by this method. Only limited computational experience is presented for the algorithm but some methods for efficient computation are suggested. (Author)

Descriptors :   (*MACHINE SHOP PRACTICE, SCHEDULING), (*SCHEDULING, OPTIMIZATION), ALGORITHMS, SEQUENCES(MATHEMATICS), GRAPHICS, SET THEORY, PRODUCTION CONTROL, COMPUTER PROGRAMS, THESES

Subject Categories : Operations Research
      Mfg & Industrial Eng & Control of Product Sys

Distribution Statement : APPROVED FOR PUBLIC RELEASE