SCHEDULING TASKS WITH EXPONENTIAL SERVICE TIMES ON NON-IDENTICAL PROCESSORS TO MINIMIZE VARIOUS COST-FUNCTIONS

被引：80

作者：

WEISS, G ^{[1
]}

PINEDO, M ^{[1
]}

机构：

[1] INST VENEZOLANO INVEST CIENT, CARACAS 101, VENEZUELA

来源：

JOURNAL OF APPLIED PROBABILITY | 1980年 / 17卷 / 01期

关键词：

D O I：

10.2307/3212936

中图分类号：

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

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：187 / 202

页数：16

共 41 条

[1] SCHEDULING TASKS WITH EXPONENTIAL SERVICE TIMES ON PARALLEL PROCESSORS
GLAZEBROOK, KD
[J]. JOURNAL OF APPLIED PROBABILITY, 1979, 16 (03) : 685 - 689
[2] SCHEDULING JOBS ON NONIDENTICAL IFR PROCESSORS TO MINIMIZE GENERAL COST-FUNCTIONS
RIGHTER, R
XU, SH
[J]. ADVANCES IN APPLIED PROBABILITY, 1991, 23 (04) : 909 - 924
[3] OPTIMAL SCHEDULING OF JOBS WITH EXPONENTIAL SERVICE TIMES ON IDENTICAL PARALLEL PROCESSORS
KAMPKE, T
[J]. OPERATIONS RESEARCH, 1989, 37 (01) : 126 - 133
[4] SCHEDULING JOBS WITH EXPONENTIAL PROCESSING AND ARRIVAL TIMES ON IDENTICAL PROCESSORS SO AS TO MINIMIZE THE EXPECTED MAKESPAN
VANDERHEYDEN, L
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (02) : 305 - 312
[5] Evaluating scheduling heuristics for non-identical parallel processors
Randhawa, SU
Kuo, CH
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (04) : 969 - 981
[6] Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times
Choi, Sangdo
Wilhelm, Wilbert E.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 117
[7] Mixed batch scheduling with non-identical job sizes to minimize makespan
Fan, Guo-Qiang
Wang, Jun-Qiang
Liu, Zhixin
[J]. OR SPECTRUM, 2024,
[8] CYCLIC SCHEDULING OF CLUSTER TOOLS WITH NON-IDENTICAL CHAMBER ACCESS TIMES
Kim, Dae-Kyu
Jung, Chihyun
Lee, Tae-Eog
Jung, Yu-Ju
[J]. PROCEEDINGS OF THE 2011 WINTER SIMULATION CONFERENCE (WSC), 2011, : 2068 - 2079
[9] Scheduling starting times for an active redundant system with non-identical lifetimes
Kokolakis, George
Papageorgiou, Effie
[J]. APPLIED MATHEMATICAL MODELLING, 2006, 30 (12) : 1535 - 1545
[10] SEQUENCING TASKS WITH EXPONENTIAL SERVICE TIMES TO MINIMIZE THE EXPECTED FLOW TIME OR MAKESPAN
BRUNO, J
DOWNEY, P
FREDERICKSON, GN
[J]. JOURNAL OF THE ACM, 1981, 28 (01) : 100 - 113

← 1 2 3 4 5 →