Fundamentals of Queuing Systems Statistical Methods for Analyzing Queuing Models /
Waiting in lines is a staple of everyday human life. Without really noticing, we are doing it when we go to buy a ticket at a movie theater, stop at a bank to make an account withdrawal, or proceed to checkout a purchase from one of our favorite department stores. Oftentimes, waiting lines are due...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Boston, MA :
Springer US,
2012.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Introduction
- Preliminary Concepts
- One Server, Infinite Queue (M/M/1)
- One Server, Finite Queue (M/M/1/N)
- One Server, No Queue (M/M/1/1)
- Multi Servers, Infinite Queue (M/M/k)
- Multi Servers, Finite Queue (M/M/k/N)
- Multi Servers, No Queue (M/M/k/k)
- One Server, Arbitrary Service (M/G/1)
- 2 Populations, One Server, Arbitrary Service (M/G/1/2)
- M Machines, One Repairman (M/M/1/M)
- M Machines, R Repairmen (M/M/R/M)
- One Server, Repeat Service (M/M/1/q)
- Multi Servers, Repeat Service (M/M/k/θ)
- Tandem Queues (M/M/1 : M/M/1)
- Priority System, One Server, Infinite Queue (M/M/1//P)
- Priority, One Server, Arbitrary Service (M/G/1/P)
- One Server, Constant Service (M/D/1)
- Exponential Arrivals, Erlang Service (M/E2/1)
- Erlang Arrivals, Exponential Service (E2/M/1)
- Erlang Arrivals, Erlang Service (E2/E2/1)
- Waiting Time Density, One Server (M/M/1)
- Waiting Time Density, Multi Servers (M/M/k)
- Bibliography
- Problems
- Solutions.