Routing Printed Circuit Cards Through an Assembly Cell

Christopher B. Lofgren, Leon F. McGinnis and Craig A. Tovey
Additional contact information
Christopher B. Lofgren: Georgia Institute of Technology, Atlanta, Georgia
Leon F. McGinnis: Georgia Institute of Technology, Atlanta, Georgia
Craig A. Tovey: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1991, vol. 39, issue 6, 992-1004

Abstract: The process planning problem is described for a class of flexible assembly systems for printed circuit cards. The general problem of minimizing the number of station visits is shown to be NP-complete, and two classes of heuristics are shown to have arbitrarily bad worst case performance. Implications for design and operating discipline are discussed.

Keywords: analysis of algorithms: complexity; bounds; heuristic performance; manufacturing; performance/productivity: process planning for circuit card assembly (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.6.992 (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:39:y:1991:i:6:p:992-1004

Access Statistics for this article

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