Routing Printed Circuit Cards Through an Assembly Cell

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.