Control policies for the MX/g/1 queueing system
Management Science
Average optimality in dynamic programming with general state space
Mathematics of Operations Research
Stochastic dynamic programming and the control of queueing systems
Stochastic dynamic programming and the control of queueing systems
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy
Queueing Systems: Theory and Applications
On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System
Queueing Systems: Theory and Applications
Optimal Admission Control In Queues With Workload-Dependent Service Rates
Probability in the Engineering and Informational Sciences
Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Randomized control of T-policy for an M/G/1 system
Computers and Industrial Engineering
Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness
Discrete Event Dynamic Systems
On a generic class of lÉvy-driven vacation models
Probability in the Engineering and Informational Sciences
A unified framework for the analysis of m/g/1 queue controlled by workload
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
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.