ROUTING PRINTED-CIRCUIT CARDS THROUGH AN ASSEMBLY CELL

• 成果类型: Article
• 署名作者: LOFGREN, CB; MCGINNIS, LF; TOVEY, CA
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.39.6.992
• 发表日期: 1991
• 页码: 992-1004
• 关键词: analysis of algorithms; complexity; bounds; AND HEURISTIC PERFORMANCE; Manufacturing; PERFORMANCE PRODUCTIVITY; PROCESS PLANNING FOR CIRCUIT CARD ASSEMBLY

摘要

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.