| Article ID: | iaor19931330 |
| Country: | United States |
| Volume: | 39 |
| Issue: | 6 |
| Start Page Number: | 992 |
| End Page Number: | 1004 |
| Publication Date: | Nov 1991 |
| Journal: | Operations Research |
| Authors: | Lofgren Christopher B. |
| Keywords: | manufacturing industries |
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.