COMBINATORIAL PROBLEMS - REDUCIBILITY AND APPROXIMATION

被引：19

作者：

SAHNI, S ^{[1
]}

HOROWITZ, E ^{[1
]}

机构：

[1] UNIV SO CALIF, LOS ANGELES, CA 90007 USA

来源：

关键词：

D O I：

10.1287/opre.26.5.718

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：718 / 759

页数：42

共 71 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

ANGULIN D, 1977, 9TH P ANN ACM S THEO, P30

[3]

[Anonymous], [No title captured]

[4]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[5]

BRADLEY GH, 1961, MANAGE SCI, V17, P354

[6]

BRUCKER P, UNPUBLISHED

[7] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

[8]

BRUNO J, 1974, P IFIPS C N HOLL AMS, V74, P504

[9]

CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

[10]

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