A note on the optimality of the N- and D-policies for the M/G/1 queue

被引：23

作者：

Artalejo, JR ^{[1
]}

机构：

[1] Univ Complutense Madrid, Fac Math, Dept Stat & OR, E-28040 Madrid, Spain

来源：

OPERATIONS RESEARCH LETTERS | 2002年 / 30卷 / 06期

关键词：

M/G/1; queue; control of the service process;

D O I：

10.1016/S0167-6377(02)00148-7

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This note considers the N- and D-policies for the M/G/1 queue. We concentrate on the true relationship between the optimal N- and D-policies when the cost function is based on the expected number of customers in the system. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：375 / 376

页数：2

共 6 条

[1]

ARTALEJO JR, IN PRESS J ENG SIMUL, V19

[2] CONTROL PROBLEM OF BALACHANDRAN AND TIJMS [J].

BOXMA, OJ .

MANAGEMENT SCIENCE, 1976, 22 (08) :916-917

[3]

Li J., 1992, PROBAB ENG INFORM SC, V6, P287

[4] On optimal exhaustive policies for the M/G/1-queue [J].

Lillo, RE ;

Martín, M .

OPERATIONS RESEARCH LETTERS, 2000, 27 (01) :39-46

[5]

Rubin I., 1988, Data Communication Systems and their Performance. Proceedings of the Third IFIP TC 6/WG 7.3 International Conference, P315

[6]

TIJMS HC, 1978, C MATH SOC JANOS BOL, P359

← 1 →