Routing Printed Circuit Cards Through an Assembly Cell
Christopher B. Lofgren, Leon F. McGinnis, Craig A. Tovey
Operations Research · 1991 · Volume 39 · Issue 6
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
Enable JavaScript for citation tools and additional paper interactions.