In this thesis, a multiple-stage - product sequence selection problem was mathematically modeled and analyzed. A fortran program that calculates the machine requirements for each machine station and each product type, and searches for the optimal product sequence combination was developed. Four cases of the sequence selection problem were analyzed in detail. A comparison of homogenous machine stations and product lines was made in an analytical manner. Results of an example problem solved for the above types of systems were presented. Computational results for different sequence combinations (ranging from 8 to 125) are discussed. / Master of Science
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/87135 |
| Date | January 1982 |
| Creators | Nnaji, Bartholomew O. |
| Contributors | Industrial Engineering and Operations Research |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Thesis, Text |
| Format | vii, 171 leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 8440975 |
Page generated in 0.913 seconds