Scribd
Upload
50 views8 pages

Problem Title: Queuing Model M/M/s (Exponential Service Times)

The document appears to be discussing queuing models for different systems with exponential, constant, and general service times. It provides input data needed for the models, such as arrival and service rates, and describes the outputs that can be calculated, like average wait times and utilization rates. However, all results are shown as errors because the input data does not meet the required conditions of the service rate being greater than the arrival rate for the models to function properly.

Uploaded by

Victor Ziyuan Wang
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
50 views8 pages

Problem Title: Queuing Model M/M/s (Exponential Service Times)

The document appears to be discussing queuing models for different systems with exponential, constant, and general service times. It provides input data needed for the models, such as arrival and service rates, and describes the outputs that can be calculated, like average wait times and utilization rates. However, all results are shown as errors because the input data does not meet the required conditions of the service rate being greater than the arrival rate for the models to function properly.

Uploaded by

Victor Ziyuan Wang
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 8

A 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

Problem Title
Queuing Model M/M/s (Exponential Service Times)

Input Data Arrival rate (l) Service rate (m) Number of servers (s)

Outputs Average server utilization (r) Average number of customers in the queue (Lq) Average number of customers in the system (L) Average waiting time in the queue (W q) Average time in the system (W) Probability (% of time) system is empty (P0)

#DIV/0! #N/A #N/A #N/A #N/A #N/A

ERROR. The service rate must be greater than the arrival rate.

Probabilities of 18 number in system 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Number of Units 0 1 2 3 4 5 6 7 8 9 10 11 12 Cumulative Probability Probability 0.0000 0.0000 #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!

33 34 35 36 37 38 39 40

A 13 14 15 16 17 18 19 20

B #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!

C #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!

Problem Title
Queuing Model M/D/1 (Constant Service Times)

Input Data Arrival rate (l) Service rate (m)

Outputs Average server utilization (r) Average number of customers in the queue (Lq) Average number of customers in the system (L) Average waiting time in the queue (W q) Average time in the system (W) Probability (% of time) system is empty (P0)

#DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!

ERROR. The service rate must be greater than the arrival rate.

Problem Title
Queuing Model M/G/1 (General Service Times)

Input Data Arrival rate (l) Service rate (m) Standard deviation (s)

0 0 0.0000

Outputs Average server utilization (r) Average number of customers in the queue (Lq) Average number of customers in the system (L) Average waiting time in the queue (W q) Average time in the system (W) Probability (% of time) system is empty (P0)

#DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!

ERROR. The service rate must be greater than the arrival rate.

Problem Title
Queuing Model M/M/s with a finite population

Input Data Arrival rate per customer (l) Service rate (m) Number of servers (s) Population size (N)

Outputs Average server utilization (r) Average number of customers in the queue (Lq) Average number of customers in the system (L) Average waiting time in the queue (W q) Average time in the system (W) Probability (% of time) system is empty (P0) Effective arrival rate

Probabilities of number in system Number of Units 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 Cumulative Probability Probability #DIV/0! #DIV/0! Number waiting 0

30 31

#DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!

Arrival rate(n) 0

Sum term Term 1 1 #DIV/0! #DIV/0!

#DIV/0! Sum term Term 2 2 #DIV/0! #DIV/0!

Decum term 2 #DIV/0!

P0(s) #DIV/0!

You might also like