Waiting Time Density, One Server (M/M/1)

Nick T. Thomopoulos ()
Additional contact information
Nick T. Thomopoulos: Illinois Institute of Technology, Stuart School of Business

Chapter Chapter 22 in Fundamentals of Queuing Systems, 2012, pp 155-158 from Springer

Abstract: Abstract This chapter shows how to calculate the waiting time probabilities for a one-server system, with infinite capacity, exponential inter-arrival times and exponential service times, where the customers are serviced in a first-in-first-out discipline. An example is when a city designs a beat for a squad car and wants to determine the probability that at least 90 percent of the calls received for the beat can begin service within 10 min. The squad car is the service facility and the calls within the beat are the arrivals. Examples are presented.

Keywords: Service Time; Wait Time; Utilization Ratio; Service Facility; Wait Time Distribution (search for similar items in EconPapers)
Date: 2012
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:sprchp:978-1-4614-3713-0_22

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

DOI: 10.1007/978-1-4614-3713-0_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().