Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy
- 18 February 2010
- journal article
- research article
- Published by Taylor & Francis in Stochastic Models
- Vol. 26 (1) , 98-123
Abstract
In this paper, we consider the queueing system under the MAP (Markovian Arrival process) arrivals and 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 time of the waiting customers exceeds D, whichever occurs first (Min(N, D)-policy). We analyze the queue length, workload, and waiting time. Then, we present numerical examples in which our analytical results are compared with the simulation estimates for verification purposes. We also compare our system with the M/G/1 queue under the same parameter setting and show that a naive Poisson assumption may severely underestimate the mean performance measures.Keywords
This publication has 32 references indexed in Scilit:
- A note on the optimality of the N- and D-policies for the M/G/1 queueOperations Research Letters, 2002
- A UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONSStochastic Models, 2002
- On the M/G/1 queue with D-policyApplied Mathematical Modelling, 2001
- Letters to the EditorJournal of Applied Probability, 2001
- Queueing processes in bulk systems under the D-policyJournal of Applied Probability, 1998
- Workloads and waiting times in single-server systems with multiple customer classesQueueing Systems, 1989
- A Classified Bibliography of Research on Optimal Design and Control of QueuesOperations Research, 1977
- Note—Note on a Control Problem of Balachandran and TijmsManagement Science, 1976
- Comment on “Solving the ‘Marketing Mix’ Problem using Geometric Programming”Management Science, 1975
- Control Policies for a Single Server SystemManagement Science, 1973