An integer programming heuristic for component allocation in printed circuit card assembly systems

An integer programming heuristic for component allocation in printed circuit card assembly systems

0.00 Avg rating0 Votes
Article ID: iaor20023462
Country: Netherlands
Volume: 7
Issue: 4
Start Page Number: 351
End Page Number: 369
Publication Date: Jul 2001
Journal: Journal of Heuristics
Authors: , , ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.