Persistent Link:
http://hdl.handle.net/10150/277124
Title:
Solution to a bay design and production sequencing problem
Author:
Creswell, Steven Howard, 1961-
Issue Date:
1989
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This thesis addresses the problem of setting up a surface mount placement machine for production. The objective is to minimize the number of machine changeovers made during a production run consisting of a number of circuit cards. The solution to the problem involves two separate decisions. The first decision considers determining how to combine feeders together in "bays" or groups of feeders, and how to assign the bays to the circuit cards. The second decision considers the circuit card production sequence. A mathematical programming formulation is given, however, its solution is very difficult for problems of a realistic size. Several heuristic approaches are suggested and used to solve actual and test problems. The heuristic for bay design uses clustering techniques used in Group Technology while the sequencing problem is solved using heuristics based on solution techniques for the Traveling Salesman problem.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Surface mount technology.; Configuration management -- Mathematical models.; Group technology.; Traveling-salesman problem.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Systems and Industrial Engineering
Degree Grantor:
University of Arizona
Advisor:
Goldberg, Jeffery B.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleSolution to a bay design and production sequencing problemen_US
dc.creatorCreswell, Steven Howard, 1961-en_US
dc.contributor.authorCreswell, Steven Howard, 1961-en_US
dc.date.issued1989en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis thesis addresses the problem of setting up a surface mount placement machine for production. The objective is to minimize the number of machine changeovers made during a production run consisting of a number of circuit cards. The solution to the problem involves two separate decisions. The first decision considers determining how to combine feeders together in "bays" or groups of feeders, and how to assign the bays to the circuit cards. The second decision considers the circuit card production sequence. A mathematical programming formulation is given, however, its solution is very difficult for problems of a realistic size. Several heuristic approaches are suggested and used to solve actual and test problems. The heuristic for bay design uses clustering techniques used in Group Technology while the sequencing problem is solved using heuristics based on solution techniques for the Traveling Salesman problem.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectSurface mount technology.en_US
dc.subjectConfiguration management -- Mathematical models.en_US
dc.subjectGroup technology.en_US
dc.subjectTraveling-salesman problem.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorGoldberg, Jeffery B.en_US
dc.identifier.proquest1338517en_US
dc.identifier.oclc23156797en_US
dc.identifier.bibrecord.b17583305en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.