PREEMPTIVE SCHEDULING TO MINIMIZE MAXIMUM COMPLETION-TIME ON UNIFORM PROCESSORS WITH MEMORY CONSTRAINTS

被引：6

作者：

MARTEL, C

机构：

[1] Univ of California, Davis, CA, USA, Univ of California, Davis, CA, USA

来源：

关键词：

D O I：

10.1287/opre.33.6.1360

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

SCHEDULING

引用

页码：1360 / 1380

页数：21

共 9 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] PREEMPTIVE SCHEDULING OF UNIFORM PROCESSOR SYSTEMS [J].

GONZALEZ, T ;

SAHNI, S .

[3]

Kafura D. G., 1977, SIAM Journal on Computing, V6, P167, DOI 10.1137/0206014

[4]

LAI TH, 1983, SIAM J COMPUT, V13, P690

LAWLER, EL ;

LABETOULLE, J .

[6]

MARTEL C, 1983, PARALLEL LARGE SCALE, P67

[7] SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].

MCNAUGHTON, R .

[8]

Megiddo N., 1979, Mathematics of Operations Research, V4, P414, DOI 10.1287/moor.4.4.414

SAHNI, S ;

CHO, Y .