ROUTING PRINTED-CIRCUIT CARDS THROUGH AN ASSEMBLY CELL

被引:13
作者
LOFGREN, CB
MCGINNIS, LF
TOVEY, CA
机构
关键词
ANALYSIS OF ALGORITHMS; COMPLEXITY; BOUNDS; AND HEURISTIC PERFORMANCE; MANUFACTURING; PERFORMANCE PRODUCTIVITY; PROCESS PLANNING FOR CIRCUIT CARD ASSEMBLY;
D O I
10.1287/opre.39.6.992
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:992 / 1004
页数:13
相关论文
共 11 条
[11]  
TULKOFF J, 1985, COMPUTER AIDED PROCE