PREEMPTIVE SCHEDULING OF UNIFORM MACHINES BY ORDINARY NETWORK FLOW TECHNIQUES

被引：53

作者：

FEDERGRUEN, A ^{[1
]}

GROENEVELT, H ^{[1
]}

机构：

[1] UNIV ROCHESTER,GRAD SCH MANAGEMENT,ROCHESTER,NY 14627

来源：

MANAGEMENT SCIENCE | 1986年 / 32卷 / 03期

关键词：

D O I：

10.1287/mnsc.32.3.341

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：341 / 349

页数：9

共 24 条

[1]

Bruno J., 1976, 213 PENNS STAT U COM

[2]

FEDERGRUEN A, UNPUB OPER RES

[3]

FEDERGRUEN A, 1984, UNPUB OPTIMAL POLYMA

[4] LEXICOGRAPHICALLY OPTIMAL BASE OF A POLYMATROID WITH RESPECT TO A WEIGHT VECTOR [J].

FUJISHIGE, S .

MATHEMATICS OF OPERATIONS RESEARCH, 1980, 5 (02) :186-196

[5] A PRIMAL SIMPLEX VARIANT FOR THE MAXIMUM-FLOW PROBLEM [J].

GLOVER, F ;

KLINGMAN, D ;

MOTE, J ;

WHITMAN, D .

NAVAL RESEARCH LOGISTICS, 1984, 31 (01) :41-61

[6] A NOTE ON SPECIALIZED VERSUS UNSPECIALIZED METHODS FOR MAXIMUM-FLOW PROBLEMS [J].

GLOVER, F ;

KLINGMAN, D ;

MEAD, M ;

MOTE, J .

NAVAL RESEARCH LOGISTICS, 1984, 31 (01) :63-65

[7]

GLOVER F, 1981, MATH PROGRAM STUD, V15, P148, DOI 10.1007/BFb0120942

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

GONZALEZ, T ;

SAHNI, S .

JOURNAL OF THE ACM, 1978, 25 (01) :92-101

[9] A NEW ALGORITHM FOR PREEMPTIVE SCHEDULING OF TREES [J].

GONZALEZ, TF ;

JOHNSON, DB .

JOURNAL OF THE ACM, 1980, 27 (02) :287-312

[10]

GUSFIELD D, 1985, FAST ALGORITHMS BIPA

← 1 2 3 →