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

Eugene A. Feinberg*, Offer Kella

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

40 Scopus citations


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 languageAmerican English
Pages (from-to)355-376
Number of pages22
JournalQueueing Systems
Issue number4
StatePublished - 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.


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


Dive into the research topics of 'Optimality of D-policies for an M/G/1 queue with a removable server'. Together they form a unique fingerprint.

Cite this