M/G/1 Queues Using Markov Chains and LSTs

Moshe Haviv
Additional contact information
Moshe Haviv: The Hebrew University

Chapter Chapter 6 in Queues, 2013, pp 81-98 from Springer

Abstract: Abstract In examining the M/G/1 model in the previous chapter, we dealt there mainly with mean values, such as the mean number of customers in the system or the mean queueing time. Here we will give more details. For example, we will look for the distribution of time in the system spent by a customer and for the distribution of the number of customers in the queue. It is easy to see that the former distribution varies with the queueing regime while the latter does not (as long as it is nonpreemptive, non-anticipating, and work-conserving), so we need to specify what it is. Naturally, we assume it to be FCFS.

Keywords: Mean Queueing Time; Queuing Time; Busy Period; Residual Service Time; Alternative Recursion (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:isochp:978-1-4614-6765-6_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461467656

DOI: 10.1007/978-1-4614-6765-6_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().