Return to search

Solution to a bay design and production sequencing problem

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.

Identiferoai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/277124
Date January 1989
CreatorsCreswell, Steven Howard, 1961-
ContributorsGoldberg, Jeffery B.
PublisherThe University of Arizona.
Source SetsUniversity of Arizona
Languageen_US
Detected LanguageEnglish
Typetext, Thesis-Reproduction (electronic)
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.

Page generated in 0.0021 seconds