M/G/1 vacation model with limited service discipline and hybrid switching-on policy

Alexander V. Babitsky

Mathematical Problems in Engineering, 1997, vol. 3, 1-11

Abstract:

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty or K customers were served during a busy period. The server idles until it finds at least N waiting units upon return from a vacation.

Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.

Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/3/454613.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/3/454613.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:454613

DOI: 10.1155/S1024123X97000550

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().