An M/G/1 queueing system with compulsory server vacations.

Kilash C. Madan

Trabajos de Investigación Operativa (1992)

  • Volume: 7, Issue: 1, page 105-115
  • ISSN: 0213-8204

Abstract

top
This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date λ and the service is performed in batches of fixed size M (≥1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived and in a particular case the mean queue length has been obtained explicitly.

How to cite

top

Madan, Kilash C.. "An M/G/1 queueing system with compulsory server vacations.." Trabajos de Investigación Operativa 7.1 (1992): 105-115. <http://eudml.org/doc/40626>.

@article{Madan1992,
abstract = {This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date λ and the service is performed in batches of fixed size M (≥1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived and in a particular case the mean queue length has been obtained explicitly.},
author = {Madan, Kilash C.},
journal = {Trabajos de Investigación Operativa},
keywords = {Teoría de colas; Vacantes; Función de probabilidad; Transformada de Laplace; batch service; server vacations; steady state; mean queue length; single server queue; Laplace transforms; probability generating functions},
language = {eng},
number = {1},
pages = {105-115},
title = {An M/G/1 queueing system with compulsory server vacations.},
url = {http://eudml.org/doc/40626},
volume = {7},
year = {1992},
}

TY - JOUR
AU - Madan, Kilash C.
TI - An M/G/1 queueing system with compulsory server vacations.
JO - Trabajos de Investigación Operativa
PY - 1992
VL - 7
IS - 1
SP - 105
EP - 115
AB - This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date λ and the service is performed in batches of fixed size M (≥1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived and in a particular case the mean queue length has been obtained explicitly.
LA - eng
KW - Teoría de colas; Vacantes; Función de probabilidad; Transformada de Laplace; batch service; server vacations; steady state; mean queue length; single server queue; Laplace transforms; probability generating functions
UR - http://eudml.org/doc/40626
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.