Optimal control of a flexible server

被引：28

作者：

Ahn, HS ^{[1
]}

Duenyas, I

Zhang, RQ

机构：

[1] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA

[2] Univ Michigan, Sch Business, Ann Arbor, MI 48109 USA

[3] Cornell Univ, Johnson Grad Sch Management, Ithaca, NY 14853 USA

来源：

ADVANCES IN APPLIED PROBABILITY | 2004年 / 36卷 / 01期

关键词：

stochastic scheduling; multiserver queue; flexible server; clearing system;

D O I：

10.1239/aap/1077134468

中图分类号：

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

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

We consider the dynamic scheduling of a multiclass queueing system with two servers, one dedicated (server 1) and one flexible (server 2), with no arrivals. Server 1 is dedicated to processing type-1 jobs while server 2 is primarily responsible for processing type-2 jobs but can also aid server I with its work. We address when it is optimal for server 2 to aid server I with type-1 jobs rather than process type-2 jobs. The objective is to minimize the total holding costs incurred until all jobs in the system are processed and leave the system. We show that the optimal policy can exhibit one of three possible structures: (i) an exhaustive policy for type-2 jobs, (ii) a nonincreasing switching curve in the number of type-1 jobs and (iii) a nondecreasing switching curve in the number of type-1 jobs. We characterize the necessary and sufficient conditions under which each policy will be optimal. We also explore the use of the optimal policy for the problem with no arrivals as a heuristic for the problem with dynamic arrivals.

引用

页码：139 / 170

页数：32

共 18 条

[1] Optimal stochastic scheduling of a two-stage tandem queue with parallel servers [J].

Ahn, HS ;

Duenyas, I ;

Zhang, RQ .

ADVANCES IN APPLIED PROBABILITY, 1999, 31 (04) :1095-1117

[2] Server assignment policies for maximizing the steady-state throughput of finite queueing systems [J].

Andradóttir, S ;

Ayhan, H ;

Down, DG .

MANAGEMENT SCIENCE, 2001, 47 (10) :1421-1439

[3]

Bell SL, 2001, ANN APPL PROBAB, V11, P608

[4] THE C-MU RULE REVISITED [J].

BUYUKKOC, C ;

VARAIYA, P ;

WALRAND, J .

ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :237-238

[5] In search of sensitivity in network optimization [J].

Chen, M ;

Pandit, C ;

Meyn, S .

QUEUEING SYSTEMS, 2003, 44 (04) :313-363

[6] Control of a single-server tandem queueing system with setups [J].

Duenyas, I ;

Gupta, D ;

Olsen, TL .

OPERATIONS RESEARCH, 1998, 46 (02) :218-230

[7] OPTIMAL USE OF AN EXTRA SERVER IN A 2 STATION TANDEM QUEUING NETWORK [J].

FARRAR, TM .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1993, 38 (08) :1296-1300

[8]

Harrison JM, 1998, ANN APPL PROBAB, V8, P822

[9] Heavy traffic resource pooling in parallel-server systems [J].

Harrison, JM ;

López, MJ .

QUEUEING SYSTEMS, 1999, 33 (04) :339-368

[10]

Iravani S., 1996, 9609 U TOR DEP IND E

← 1 2 →