Expected makespan minimization on identical machines in two interconnected queues

被引：10

作者：

Javidi, T ^{[1
]}

Song, NO

Teneketzis, D

机构：

[1] Univ Michigan, EECS Dept, Ann Arbor, MI 48109 USA

[2] Natl Inst Stand & Technol, Adv Network Technol Div, Gaithersburg, MD 20899 USA

来源：

PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES | 2001年 / 15卷 / 04期

关键词：

D O I：

10.1017/S026996480115401X

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We study the scheduling of jobs in a system of two interconnected service stations, called Q(1) and Q(2), on m(m greater than or equal to 2) identical machines available in parallel, so that every machine can process any jobs in Q(1) or Q(2). Preemption is allowed. Under certain conditions on the arrival, service, and interconnection processes, we determine a scheduling policy that minimizes the expected makespan.

引用

页码：409 / 443

页数：35

共 18 条

[1]

BRUNO J, 1981, J ASS COMPUTATIONAL, P28

[2]

JAVIDI T, 2000, CGR00UO U MICH CONTR

[3] Optimal scheduling on parallel processors with precedence constraints and general costs [J].