ON THE OPTIMALITY OF STATIC PRIORITY POLICIES IN STOCHASTIC SCHEDULING ON PARALLEL MACHINES

被引：22

作者：

KAMPKE, T

机构：

来源：

JOURNAL OF APPLIED PROBABILITY | 1987年 / 24卷 / 02期

关键词：

D O I：

10.2307/3214267

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：430 / 448

页数：19

共 10 条

[1] SEQUENCING TASKS WITH EXPONENTIAL SERVICE TIMES TO MINIMIZE THE EXPECTED FLOW TIME OR MAKESPAN [J].

BRUNO, J ;

DOWNEY, P ;

FREDERICKSON, GN .

JOURNAL OF THE ACM, 1981, 28 (01) :100-113

[2] SCHEDULING TASKS WITH EXPONENTIAL SERVICE TIMES ON PARALLEL PROCESSORS [J].

GLAZEBROOK, KD .

JOURNAL OF APPLIED PROBABILITY, 1979, 16 (03) :685-689

[3]

Lovasz L., 1983, MATH PROGRAMMING STA, P235, DOI DOI 10.1007/978-3-642-68874-4_10

[4]

Mohring R. H., 1985, Zeitschrift fur Operations Research, Serie A (Theorie), V29, P65, DOI 10.1007/BF01918198

[5]

MOHRING RH, 1985, CONTRIBUTIONS OPERAT, P72

[6]

PRASAD VR, 1982, J APPL PROB, V19, P741

[7]

TRIVEDI KS, 1982, PROBABILITY STATISTI

[8] SCHEDULING JOBS WITH STOCHASTICALLY ORDERED PROCESSING TIMES ON PARALLEL MACHINES TO MINIMIZE EXPECTED FLOWTIME [J].

WEBER, RR ;

VARAIYA, P ;

WALRAND, J .

JOURNAL OF APPLIED PROBABILITY, 1986, 23 (03) :841-847

[9] SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS ON PARALLEL MACHINES TO MINIMIZE MAKESPAN OR FLOWTIME [J].

WEBER, RR .

JOURNAL OF APPLIED PROBABILITY, 1982, 19 (01) :167-182

[10] SCHEDULING TASKS WITH EXPONENTIAL SERVICE TIMES ON NON-IDENTICAL PROCESSORS TO MINIMIZE VARIOUS COST-FUNCTIONS [J].

WEISS, G ;

PINEDO, M .

JOURNAL OF APPLIED PROBABILITY, 1980, 17 (01) :187-202

← 1 →