ISSN:
1572-9370
Keywords:
printed circuit board assembly
;
surface mount technology
;
quadratic integer programming
;
dynamic programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
Notes:
Abstract Populating printed circuit boards is one of the most costly and time-consuming steps in electronics assembly. At the beginning of each work order, three decisions are required: (1) a sequence must be specified for placing the individual components on the board; (2) tape reels must be assigned to positions on the magazine rack; and (3) a retrieval plan must be determined should the same component type be assigned to more than one magazine slot. Collectively, these problems can be modeled as a nonlinear integer program. In this paper, we develop a series of algorithms for solving each using an iterative two step approach. Initially, a placement sequence is generated with a weighted, nearest neighbor traveling salesman problem (TSP) heuristic; the two remaining problems are then formulated as a quadratic integer program and solved with a Lagrangian relaxation scheme. As a final step, the current magazine assignments are used to update the placement sequence, and the entire process is repeated. Our ability to deal, at least in part, with simultaneous machine operations represents the major contribution of this work. The methodology was simulated for a set of boards obtained from Texas Instruments and theoretically compared with a heuristic currently in use.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01324873
Permalink
