ROUTING PRINTED-CIRCUIT CARDS THROUGH AN ASSEMBLY CELL

被引：13

作者：

LOFGREN, CB

MCGINNIS, LF

TOVEY, CA

机构：

来源：

OPERATIONS RESEARCH | 1991年 / 39卷 / 06期

关键词：

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 条

[1]

Aho A.V., 1983, DATA STRUCTURES ALGO

[2]

AMMONS JC, 1985, ANN OPER RES, V3, P319

[3]

Chang T. C., 1985, INTRO AUTOMATED PROC

[4]

Coffman E.G., 1976, COMPUTER JOB SHOP SC

[5]

COFFMAN EG, 1972, ACTA INFORM, V1, P200, DOI DOI 10.1007/BF00288685

[6] AFFIRMATIVE-ACTION ALGORITHMS [J].

FATHI, Y ;

TOVEY, C .

MATHEMATICAL PROGRAMMING, 1986, 34 (03) :292-301

[7]

Garey MR., 1979, COMPUTERS INTRACTABI

[8]

Graham R., 1978, MATH TODAY, P183

[9] PARALLEL SEQUENCING AND ASSEMBLY LINE PROBLEMS [J].

HU, TC .

OPERATIONS RESEARCH, 1961, 9 (06) :841-848

[10]

KIRAN AS, 1986, COMPLEXITY FMS LOADI

← 1 2 →