EXACT, APPROXIMATE, AND GUARANTEED ACCURACY ALGORITHMS FOR FLOW-SHOP PROBLEM N-2-F-BARF

被引：28

作者：

KOHLER, WH

STEIGLITZ, K

机构：

[1] UNIV MASSACHUSETTS,DEPT ELECT & COMP ENGN,AMHERST,MA 01002

[2] PRINCETON UNIV,DEPT ELECT ENGN,PRINCETON,NJ 08540

来源：

JOURNAL OF THE ACM | 1975年 / 22卷 / 01期

关键词：

D O I：

10.1145/321864.321872

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：106 / 114

页数：9

共 13 条

[1] AN EXPERIMENTAL INVESTIGATION AND COMPARATIVE EVALUATION OF FLOW-SHOP SCHEDULING TECHNIQUES [J].

ASHOUR, S .

OPERATIONS RESEARCH, 1970, 18 (03) :541-&

[2]

Conway R, 1967, THEORY SCHEDULING

[3] REVIEW OF SEQUENCING RESEARCH [J].

DAY, JE ;

HOTTENSTEIN, MP .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1970, 17 (01) :11-+

[4]

ELMAGHRABY SE, 1968, NAV RES LOGIST Q, V15, P205

[5]

GUPTA JND, 1971, J OPER RES SOC JPN, V13, P169

[6] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS [J].

IGNALL, E ;

SCHRAGE, L .

OPERATIONS RESEARCH, 1965, 13 (03) :400-&

[7] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS [J].

KOHLER, WH ;

STEIGLIT.K .

JOURNAL OF THE ACM, 1974, 21 (01) :140-156

[8]

KOHLER WH, 1972, THESIS PRINCETON U

[9]

KRONE M, TO BE PUBLISHED

[10] COMPUTER SOLUTIONS OF TRAVELING SALESMAN PROBLEM [J].

LIN, S .

BELL SYSTEM TECHNICAL JOURNAL, 1965, 44 (10) :2245-+

← 1 2 →