Near optimal sequencing :N jobs and M machines; all jobs to be processed through the same order of machines

Author

Larry Glen Clark

Abstract

"There is a need, in industry, for an efficient method of determining an optimal sequence for processing a number of jobs through two or more machines. A method which requires a minimum amount of time would be most beneficial. The purpose of this study has been to define such a method. Tests on the method described indicate that although an optimal solution is not always obtained, the solutions obtained are quite good and due to the time factor the method would be beneficial to industry"--Abstract, page ii.

Advisor(s)

Gillett, Billy E.

Committee Member(s)

Antle, Charles E.
Richards, Earl F., 1923-
Zenor, Hughes M., 1908-2001

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri at Rolla

Publication Date

1965

Pagination

v, 33 pages

Rights

© 1965 Larry Glen Clark, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Subject Headings

Sequential machine theoryComputer programs

Thesis Number

T 1779

Print OCLC #

5968814

Electronic OCLC #

841378606

Recommended Citation

Clark, Larry Glen, "Near optimal sequencing :N jobs and M machines; all jobs to be processed through the same order of machines" (1965). Masters Theses. 7029.
https://scholarsmine.mst.edu/masters_theses/7029