An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems

Authors:
Gail W. Depuy;Martin W. P. Savelsbergh;Jane C. Ammons;Leon F. Mcginnis
Affiliations:
University of Louisville, Louisville, Kentucky. depuy@louisville.edu;Georgia Institute of Technology, Atlanta, Georgia;Georgia Institute of Technology, Atlanta, Georgia;Georgia Institute of Technology, Atlanta, Georgia
Venue:
Journal of Heuristics
Year:
2001

Citing 4
Cited 1

A branch and bound approach for machine load balancing in flexible manufacturing systems

Management Science
Component allocation and partitioning for a dual delivery placement machine

Operations Research
Sequencing of insertions in printed circuit board assembly

Operations Research
Throughput rate optimization in the automated assembly of printed circuit boards

Annals of Operations Research

Heuristic approaches for batching jobs in printed circuit board assembly

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Component allocation is an important element of process planning for printed circuit card assembly systems. The component allocation problem directly impacts the productivity and cost of a circuit card assembly system. Many companies have recognized the importance of component allocation and have started to develop a better decision process. Also, a few commercial software packages have been developed that provide environments to support process planning. However, optimization methods are not yet widely used. We demonstrate that component allocation is amenable to improvement using optimization methods. We present an integer programming heuristic for the component allocation problem and report on several case studies that have been conducted and that demonstrate its effectiveness. The heuristic is based on a mixed integer programming formulation of the component allocation problem that incorporates estimates of downstream process planning decisions.