One Server, Constant Service (M/D/1)

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

Chapter Chapter 18 in Fundamentals of Queuing Systems, 2012, pp 123-127 from Springer

Abstract: Abstract This chapter concerns a one-server system with infinite capacity where the inter-arrival times are exponential and the service times are constant. An example is the cars arriving to a carwash where the service time is always the same. The probability on n units in the system, and the related performance measures are developed. Examples are presented.

Keywords: Service Time; Utilization Ratio; Service Facility; Input Time; Apartment Building (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_18

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

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

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 ().