Muli-stage [i.e. Multi-stage] multi-product lotsize sequencing of operations

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.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Industrial Engineering and Operations Research

Department dc:contributor.department

Industrial Engineering and Operations Research

Grantor dc:publisher

Virginia Polytechnic Institute and State University

Year dc:date.issued

1982

Author dc:creator

• Nnaji, Bartholomew O.

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language.iso

en

Handle dc:identifier.uri

http://hdl.handle.net/10919/87135

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/87135