Staging Problem of a Dual Delivery Pick-and-Place Machine in Printed Circuit Card Assembly

Reza H. Ahmadi and Panagiotis Kouvelis
Additional contact information
Reza H. Ahmadi: University of California, Los Angeles, California
Panagiotis Kouvelis: Duke University, Durham, North Carolina

Operations Research, 1994, vol. 42, issue 1, 81-91

Abstract: This paper addresses a material staging problem arising from a dual delivery pick-and-place machine that is used for the assembly of printed circuit boards where components are attached using “surface mount technology.” The staging problem of such machines involves allocation of component feeders to its two-feeder carriers along with the corresponding sets of vacuum nozzles to dispense the components. The usual managerial objective for the staging problem is minimization of the total time required to populate the circuit boards, i.e., the pick-and-place machine's cycle time. For the dual delivery pick-and-place machines this implies minimization of the workload imbalance between the two carriers and reduction of the number of vacuum nozzle changes required. In this paper, we develop algorithms to optimally solve the single and multiple product staging problem for the above managerial objectives.

Keywords: production/scheduling: pick-and-place machine; electronic assembly; programming; integer: Lagrangian relaxation (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.42.1.81 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:42:y:1994:i:1:p:81-91

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().