SCHEDULING TO MINIMIZE MAXIMUM CUMULATIVE COST SUBJECT TO SERIES-PARALLEL PRECEDENCE CONSTRAINTS

被引：31

作者：

ABDELWAHAB, HM

KAMEDA, T

机构：

来源：

关键词：

Compendex;

D O I：

10.1287/opre.26.1.141

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

OPERATIONS RESEARCH

引用

页码：141 / 158

页数：18

共 20 条

[1]

ABDELWAHAB HM, 1976, THESIS U WATERLOO

[2]

Baker K., 1974, INTRO SEQUENCING SCH

[3]

Coffman Jr E. G., 1973, OPERATING SYSTEMS TH

[4] TOPOLOGY OF SERIES-PARALLEL NETWORKS [J].

DUFFIN, RJ .

ELMAGHRABY, SE .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03) :339-+

[6]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[7]

HEBALKAR PG, 1970, PROJ MAC C WOODS HOL, P151

HORN, WA .

[9]

KARP RM, 1973, COMPLEXITY COMPUTER, P85

[10]

Knuth D. E., 1973, ART COMPUTER PROGRAM