MAP/G/1 Queue Under Workload Control and Postprocessing
- 23 February 2009
- journal article
- research article
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 27 (2) , 331-352
Abstract
This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Poisson queue.Keywords
This publication has 25 references indexed in Scilit:
- A note on the optimality of the N- and D-policies for the M/G/1 queueOperations Research Letters, 2002
- Optimality of D-Policies for an M/G/1 Queue with a Removable ServerQueueing Systems, 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
- Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic PoliciesStochastic Analysis and Applications, 1995
- 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