Optimality of D-policies for an M/G/1 queue with a removable server

Eugene A. Feinberg; Offer Kella

doi:10.1023/A:1020989221378

Optimality of D-policies for an M/G/1 queue with a removable server

Eugene A. Feinberg^*, Offer Kella

^*Corresponding author for this work

Department of Statistics

Research output: Contribution to journal › Article › peer-review

40 Scopus citations

Abstract

We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding costs per unit time which is a nonnegative nondecreasing right-continuous function of a current workload in the system. We prove an old conjecture that D-policies are optimal for the average cost per unit time criterion. It means that for this criterion there is an optimal policy that either runs the server all the time or switches the server off when the system becomes empty and switches it on when the workload reaches or exceeds some threshold D.

Original language	English
Pages (from-to)	355-376
Number of pages	22
Journal	Queueing Systems
Volume	42
Issue number	4
DOIs	https://doi.org/10.1023/A:1020989221378
State	Published - 2002

Bibliographical note

Funding Information:
∗Supported in part by grant DMI-9908258 from the National Science Foundation. ∗∗Supported in part by grant 935/0 from the Israel Science Foundation.

Keywords

Average cost criterion
D-policy
M/G/1 queue
Removable server

Access to Document

10.1023/A:1020989221378

Cite this

@article{852052694f7b4b988ffc4724b36a7e94,

title = "Optimality of D-policies for an M/G/1 queue with a removable server",

abstract = "We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding costs per unit time which is a nonnegative nondecreasing right-continuous function of a current workload in the system. We prove an old conjecture that D-policies are optimal for the average cost per unit time criterion. It means that for this criterion there is an optimal policy that either runs the server all the time or switches the server off when the system becomes empty and switches it on when the workload reaches or exceeds some threshold D.",

keywords = "Average cost criterion, D-policy, M/G/1 queue, Removable server",

author = "Feinberg, {Eugene A.} and Offer Kella",

note = "Funding Information: ∗Supported in part by grant DMI-9908258 from the National Science Foundation. ∗∗Supported in part by grant 935/0 from the Israel Science Foundation.",

year = "2002",

doi = "10.1023/A:1020989221378",

language = "אנגלית",

volume = "42",

pages = "355--376",

journal = "Queueing Systems",

issn = "0257-0130",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Optimality of D-policies for an M/G/1 queue with a removable server

AU - Feinberg, Eugene A.

AU - Kella, Offer

N1 - Funding Information: ∗Supported in part by grant DMI-9908258 from the National Science Foundation. ∗∗Supported in part by grant 935/0 from the Israel Science Foundation.

PY - 2002

Y1 - 2002

N2 - We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding costs per unit time which is a nonnegative nondecreasing right-continuous function of a current workload in the system. We prove an old conjecture that D-policies are optimal for the average cost per unit time criterion. It means that for this criterion there is an optimal policy that either runs the server all the time or switches the server off when the system becomes empty and switches it on when the workload reaches or exceeds some threshold D.

AB - We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding costs per unit time which is a nonnegative nondecreasing right-continuous function of a current workload in the system. We prove an old conjecture that D-policies are optimal for the average cost per unit time criterion. It means that for this criterion there is an optimal policy that either runs the server all the time or switches the server off when the system becomes empty and switches it on when the workload reaches or exceeds some threshold D.

KW - Average cost criterion

KW - D-policy

KW - M/G/1 queue

KW - Removable server

UR - http://www.scopus.com/inward/record.url?scp=0036420851&partnerID=8YFLogxK

U2 - 10.1023/A:1020989221378

DO - 10.1023/A:1020989221378

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036420851

SN - 0257-0130

VL - 42

SP - 355

EP - 376

JO - Queueing Systems

JF - Queueing Systems

IS - 4

ER -

Optimality of D-policies for an M/G/1 queue with a removable server

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this