Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline
- 31 December 2007
- journal article
- research article
- Published by Taylor & Francis in Stochastic Analysis and Applications
- Vol. 26 (1) , 39-59
Abstract
We deal with the M/G/1 queues under the D-policy and last-come-first-served (LCFS) disciplines. We first derive the queue length and waiting time distributions in the form of probability generating functions and the Laplace–Stieltjes transforms. Then we derive the mean performance measures. Finally, we obtain the optimal values of D under a linear cost function.Keywords
This publication has 27 references indexed in Scilit:
- New fluctuation analysis of D-policy bulk queues with multiple vacationsMathematical and Computer Modelling, 2005
- 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
- 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
- Generalizations of the stochastic decomposition results for single server queues with vacationsCommunications in Statistics. Stochastic Models, 1990
- 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