A LCFS finite buffer model with batch input and non-exponential services

Nico M. van Dijk

Stochastic Processes and their Applications, 1989, vol. 33, issue 1, 123-129

Abstract: A finite last-come first-served queueing system is studied with batch input and non-exponential services. A closed form expression is obtained for the steady-state queue length distribution and shown to be insensitive to service distributional forms (i.e. to depend only on mean service times). This result is of both practical and theoretical interest as an extension of the standard exponential case.

Keywords: batch; input; LCFS; insensitivity; batch; balance (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(89)90070-7
Full text for ScienceDirect subscribers only

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:eee:spapps:v:33:y:1989:i:1:p:123-129

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().