Stochastic modelling and analysis: a computational approach
Stochastic modelling and analysis: a computational approach
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Optimality of D-Policies for an M/G/1 Queue with a Removable Server
Queueing Systems: Theory and Applications
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy
Queueing Systems: Theory and Applications
Queue length and waiting time of the M/G/1 queue under the D-policy and multiple vacations
Queueing Systems: Theory and Applications
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
New fluctuation analysis of D-policy bulk queues with multiple vacations
Mathematical and Computer Modelling: An International Journal
A mean value formula for the M/G/1 queues controlled by workload
Operations Research Letters
On optimal exhaustive policies for the M/G/1-queue
Operations Research Letters
A note on the optimality of the N- and D-policies for the M/G/1 queue
Operations Research Letters
Analysis of a discrete-time queueing system with an NT-policy
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Analysis of discrete-time Geo/G/1 queue under the D-policy
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
Analysis of discrete-time MAP/G/1 queue under workload control
Performance Evaluation
Hi-index | 0.00 |
In this paper, we consider the M/G/1 queueing system under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D, whichever occurs first. We first analyze the queue length, the workload and the waiting time. Then, we consider two linear cost models (one based on the mean workload and the other based on the mean queue length) and compare the optimal Min(N,D)-policy with the optimal N-policy and the optimal D-policy.