Instructions

Chapter 16
Operations Research Models and Methods
Paul A. Jensen and Jonathan F. Bard

Queuing Models
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/stoch_mod/index.html
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/stoch_anal/index.html
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/que_add/index.html
http://www.me.utexas.edu/~jensen/ORMM/computation/unit/rvadd/index.html

Instructions

Sect.
Link to Worksheet

The workbook also uses the Stochastic Analysis and Random Variables add-ins. Load these add-ins.
The Queuing add-in and the Random Variables add-in provide functions for analysis. Choose the
Relink command from the Queues menu and the Relink Functions command from the Random
Variables add-in.
This workbook comes without control buttons. To make the buttons choose the Add Buttons
commands from the Stochastic Models and the Stochastic Analysis add-ins.

Queuing Models
System Characteristics
Computing System Characteristics from State Probabilities

Characteristics

2
Infinite Queues
Finite Queues
Finite Populations
Repair Model
Repair Matrix
Repair Economics

To use this workbook, you must first load the Queuing and the Random Variables add-ins. See the
Excel help file topic "About add-ins" before continuing.

Markov Queuing Systems

Queuing Systems allowing Infinite Queues
Queuing Systems with Finite Queues
Queuing Systems with Finite Populations
Birth Death Model of Finite Population Repair Shop
Markov Process Rate Matrix for the Repair Problem
Economic Matrix for the Repair Problem (all zeroes)

Page 1

Instructions

Steady-State Probabilities for the Repair Problem

Birth Death Model of Finite Population Repair Shop with Two Servers
Markov Process Rate Matrix for the Repair Problem with Two Servers
Economic Matrix for the Repair Problem with Two Servers (all zeroes)
Steady-State Probabilities for the Repair Problem with Two Servers

Steady State
Repair Model (2)
Repair Matrix (2)
Repair Economics (2)
Steady State (2)
3
Non-Markov

Non-Markov Systems
Value of Reduction in Service and Arrival Process Variability

Page 2

Instructions

Add-ins Used
Queues

Queues
Queues/Random Variables
Queues
Stochastic Models
Stochastic Analysis
Stochastic Analysis

Page 3

Instructions

Stochastic
Stochastic
Stochastic
Stochastic
Stochastic

Analysis
Models
Analysis
Analysis
Analysis

Queues

Page 4

Computing System Characteristics from State Probabilities

Table 1
State, n
Probability,
pn

0
0.068

1
0.17

2
0.212

3
0.177

4
0.147

. What is the probability that all servers are idle?

Pr{all servers idle} = p0 = 0.068
2. What is the probability that a customer will not have to wait?
Pr{no wait} = p0 + p1 + p2 = 0.450
3. What is the probability that a customer will have to wait in the queue?
Pr{wait} = 1 P(no wait) = 0.550
4. What is the probability that an arriving customer is lost?
Pr{lost customer} = p6 = 0.102
5. What is the expected number of customers in the queue?
Lq = 1p4 + 2p5 + 3p6 = 0.700
6. What is the expected number in service?
Ls = p1 + 2p2 + 3(1 p0 p1 p2) = 2.244
7. What is the expected number in the system?
L = Lq + Ls = 2.944
8. What is the efficiency (utilization) of the servers?
E = Ls/s = 2.244/3 = 74.8%.
Example 1
Lambda =
5
Lambda_Bar=
4.485
Ws 0.5003344
Wq = 0.1565217
W= 0.6568562
Example 2
Analysis
l = 2 customers/min (given)
W = 3 min (given)
Ws = 1.25 min (given)
m = 0.8 customers/min
L = lW = 6 customers
Wq = W Ws = 1.75 min
Lq = lWq = 3.5 customers
Ls = lWs = 2.5 customers
E = Ls/s = 2.5/3 83.3%

2
3
1.25
0.8
6
1.75
3.5
2.5
0.833333

5.0000
0.1230

0.0680
have to wait?

0.4500
ve to wait in the queue?
0.5500
0.1030
0.7020
2.2440
2.9460
0.7480

6
0.103

Queue Station
Arrival Rate
Service Rate/Channel
Number of Servers
Max. Number in System
Number in Population
Type
Mean Number at Station
Mean Time at Station
Mean Number in Queue
Mean Time in Queue
Mean Number in Service
Mean Time in Service
Throughput Rate
Efficiency
Probability All Servers Idle
Prob. All Servers Busy
Prob. System Full
P(0)
P(1)
P(2)
P(3)
P(4)
P(5)
P(6)
P(7)
P(8)
P(9)
P(10)

Que1
5
2
3
6
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Queuing Systems allowing Infinite Queues

Queue Station
WorkStation
Arrival Rate
1.5
Service Rate/Channel
2
Number of Servers
1
Max. Number in System
***
Number in Population
***
Type
Err:511
Mean Number at Station Err:511
Mean Time at Station
Err:511
Mean Number in Queue
Err:511
Mean Time in Queue
Err:511
Mean Number in Service Err:511
Mean Time in Service
Err:511
Throughput Rate
Err:511
Efficiency
Err:511
Probability All Servers Idle Err:511
Prob. All Servers Busy
Err:511
Prob. System Full
Err:511
Critical Wait Time
1
P(Wait >= Critical Wait) Err:511 Cum
P(0)
Err:511
Err:511
P(1)
Err:511
Err:511
P(2)
Err:511
Err:511
P(3)
Err:511
Err:511
P(4)
Err:511
Err:511
P(5)
Err:511
Err:511
P(6)
Err:511
Err:511
P(7)
Err:511
Err:511
P(8)
Err:511
Err:511
P(9)
Err:511
Err:511
P(10)
Err:511

Queue Station
Arrival Rate
Service Rate/Channel
Number of Servers
Max. Number in System
Number in Population
Type
Mean Number at Station
Mean Time at Station
Mean Number in Queue
Mean Time in Queue
Mean Number in Service
Mean Time in Service
Throughput Rate
Efficiency
Probability All Servers Idle
Prob. All Servers Busy
Prob. System Full
Critical Wait Time
P(Wait >= Critical Wait)
P(0)
P(1)
P(2)
P(3)
Err:511
P(4)
Err:511
P(5)
P(6)
P(7)
P(8)
P(9)
P(10)

Workstation2
1.5
2
2
***
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511 Cum
1
1
Err:511 Cum
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Table 2
Queue Station Telephone_1Telephone_2Telephone_3
Arrival Rate
10
10
10
Service Rate/Channel
1
1
1
Number of Servers
11
12
13
Max. Number in System
***
***
***
Number in Population
***
***
***
Type
Err:511
Err:511
Err:511
Mean Number in Queue Err:511
Err:511
Err:511
Mean Time in Queue Err:511
Err:511
Err:511
Efficiency
Err:511
Err:511
Err:511
Critical Wait Time
1
1
1
P(Wait >= Critical Wait) Err:511
Err:511
Err:511

Err:511
Err:511
Err:511

elephone_3

Queuing Systems with Finite Queues

Table 3
Queue StationTechnician_1Technician_2Technician_3Technician_4Technician_5Technician_6
Arrival Rate
1.1
1.1
1.1
1.1
1.1
1.1
Service Rate/Channel
1
1
1
1
1
1
Number of Servers
1
1
1
1
1
1
Max. Number in System
1
2
3
4
5
6
Number in Population
***
***
***
***
***
***
Type Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Mean Time in Queue Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Prob. System Full Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Technician_7Technician_8Technician_9
Technician_10
1.1
1.1
1.1
1.1
1
1
1
1
1
1
1
1
7
8
9
10
***
***
***
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Queue Station
Arrival Rate
Service Rate/Channel
Number of Servers
Max. Number in System
Number in Population
Type
Mean Number at Station
Mean Time at Station
Throughput Rate
Efficiency
Prob. System Full
Critical Wait Time
P(Wait >= Critical Wait)

Processing_1Processing_2
1.5
1.5
2
2
1
2
4
5
***
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
1
1
Err:511
Err:511

Table 4
Queue Station
Proc1
Arrival Rate
1.5
Service Rate/Channel
2
Number of Servers
1
Max. Number in System
4
Number in Population
***
Type
Err:511
P(0)
Err:511
P(1)
Err:511
P(2)
Err:511
P(3)
Err:511
P(4)
Err:511
time
1
Random Variable
Distribution
mean (theta)
c
d
P(c <= x <= d)

Cum Pois.
0
0.135335281
0.406005859
0.676676393
0.857123435
Sum

ProcServ_1 ProcServ_2 ProcServ_3

Poisson
Poisson
Poisson
2
2
2
0
0
0
-1
0
1
0
0.1353353 0.406005859

Queue Station
Arrival Rate
Service Rate/Channel
Number of Servers
Max. Number in System
Number in Population
Type
P(0)
P(1)
P(2)
P(3)
P(4)
P(5)

Random Variable
Distribution
mean (theta)
c
d
P(c <= x <= d)
e
Inverse P(e)

Q(n)
Err:511
Err:511
Err:511
Err:511
0

Proc2
1.5
2
2
5
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Q(n)

Cum Pois.
0
0
0
0
Err:511 0.018315639
Err:511 0.091578193
Err:511
0.2381033
0
0.43347013
Sum

ProcServ2_1ProcServ2_2 ProcServ2_3
Poisson
Poisson
Poisson
4
4
4
0
0
0
-2
-1
0
0
0
0.018315639
0.8
0.8
0.8
6
6
6

Product
Err:511
Err:511
Err:511
Err:511
0
Err:511
ProcServ_4 ProcServ_5
Poisson
Poisson
2
2
0
0
2
3
0.6766764 0.8571234

Product
0
0
Err:511
Err:511
Err:511
0
Err:511
ProcServ2_4ProcServ2_5ProcServ2_6
Poisson
Poisson
Poisson
4
4
4
0
0
0
1
2
3
0.0915782 0.2381033 0.4334701
0.8
0.8
0.8
6
6
6

Table 5
Queue Station
rho1_1
Arrival Rate
5
Service Rate/Channel
5
Number of Servers
1
Max. Number in System
5
Number in Population
***
Type
Err:511
Mean Number at Station Err:511
Mean Time at Station Err:511
Mean Number in Queue Err:511
Mean Time in Queue Err:511
Throughput Rate
Err:511
Efficiency
Err:511
Prob. All Servers Busy Err:511
Prob. System Full
Err:511
P(0)
Err:511
P(1)
Err:511
P(2)
Err:511
P(3)
Err:511
P(4)
Err:511
P(5)
Err:511

rho1_2
10
5
2
5
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

rho1_3
15
5
3
5
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

rho1_4
20
5
4
5
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

rho1_5
25
5
5
5
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Table 6
Queue Station
Tel_zero_1 Tel_zero_2
Arrival Rate
10
10
Service Rate/Channel
1
1
Number of Servers
10
11
Max. Number in System
10
11
Number in Population
***
***
Type
Err:511
Err:511
Mean Number in Service Err:511
Err:511
Mean Time in Service Err:511
Err:511
Throughput Rate
Err:511
Err:511
Efficiency
Err:511
Err:511
Prob. System Full
Err:511
Err:511

Tel_zero_3
10
1
12
12
***
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Queuing Systems with Finite Populations

Table 7
Queue Station
Entity Arrival Rate
Service Rate/Channel
Number of Servers
Max. Number in System
Number in Population
Type
Mean Number at Station
Mean Time at Station
Mean Number in Queue
Mean Time in Queue
Mean Number in Service
Mean Time in Service
Throughput Rate
Efficiency
Probability All Servers Idle
Prob. All Servers Busy
Prob. System Full
Critical Wait Time
P(Wait >= Critical Wait)
P(0)
P(1)
P(2)
P(3)
P(4)
P(5)

Repair_1
0.02
0.05
1
5
5
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
1
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Repair_2
0.02
0.05
2
5
5
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
1
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511
Err:511

Non_Markov Queuing Systems

Table 8
Value of Reduction in Service Process Variability
Queue Station
Inventory_1Inventory_2Inventory_3
Arrival Rate
8.5
9.0066738 9.1892329
Service Rate/Channel
10
10
10
Number of Servers
1
1
1
COV of interarrival times
1
1
1
COV of service times
1
0.5
0
COV of departures
Err:511
Err:511
Err:511
Type
Err:511
Err:511
Err:511
Mean Number at Station Err:511
Err:511
Err:511
Mean Time at Station
Err:511
Err:511
Err:511
Mean Number in Queue Err:511
Err:511
Err:511
Mean Time in Queue
Err:511
Err:511
Err:511
Mean Number in Service Err:511
Err:511
Err:511
Mean Time in Service
Err:511
Err:511
Err:511
Efficiency
Err:511
Err:511
Err:511

COV of interarrival times

Mean Number at Station

Mean Number in Queue
Mean Number in Service

Table 9
Value of Reduction in Arrival Process Variability
Queue Station
Inv2_1
Inv2_2
Inv2_3
Arrival Rate
8.5
9.5774891 9.9823852
Service Rate/Channel
10
10
10
Number of Servers
1
1
1
COV of interarrival times
1
0.5
0.1
COV of service times
1
0.5
0.1
COV of departures
Err:511
Err:511
Err:511
Type
Err:511
Err:511
Err:511
Mean Number at Station Err:511
Err:511
Err:511
Mean Time at Station
Err:511
Err:511
Err:511
Mean Number in Queue Err:511
Err:511
Err:511
Mean Time in Queue
Err:511
Err:511
Err:511
Mean Number in Service Err:511
Err:511
Err:511
Mean Time in Service
Err:511
Err:511
Err:511
Efficiency
Err:511
Err:511
Err:511

Markov Process Model Name: Rep_MP

Define States

Type: Birth-Death
State Var.:
1
Event Var.:
1

Economic Measure = Cost

Fill Matrix
Add Transitions

State Vector
Event Vector
Define the state vector and logical conditions for feasi Define the event vector and logical conditions for feasible
Step Feas.
Step Feas.
1
1
State
5
Event
1
Feas.
1
1
1
Feas.
1
1
1
Min
0
Min
-1
Max
5Formula for state names
Max
1Formula for event names
5
6
S_5
2
3
Birth
6
1
3
1
Formula for state Cost
Definitions
0
Definitions
s1: Number in System
e1: +1 for birth, -1 for death

State-Event Transition Equations, Rates and Costs

Description:
State
1
Min
0
Max
4
0
1
0
Logic
s1
Index Name
Trans. Rate
Next
0
6 ### ###
0

State-Event Transition Equations, Rates and Costs

Description:
State
1
Min
1
Max
5
1
1
1
Logic
s1
Index Name
Trans. Rate
Next
0
6 ### ###
0.05

Index
1
2

s1
0
1

Number
Name in Population
Arrival Rate
Measure 3
S_0
0
0.1
0
S_1
1
0.08
0

Event
Min
Max

Trans. Prob.
1

Event
Min
Max
Trans. Prob.
1

1
1
1
1
Trans. Cost
0

-1
-1
0
1
Trans. Cost
0

3
4
5
6

2
3
4
5

S_2
S_3
S_4
S_5

2
3
4
5

0.06
0.04
0.02
0

0
0
0
0

Birth-Death Model
Build Matrix Model

Maximum number in system =

5
d logical conditions for feasible events.
Economic Measure = Cost
Time Measure = Hour
0
Birth Rate
0.1
0
Death Rate
0
ula for event names
Cost Rate for Items in the System =
0
Cost per Item Entering =
0
Cost per Item Leaving =
0

1
0.08
1
0.05

2
0.06
2
0.05

3
0.04
3
0.05

4
0.02
4
0.05

5
0
5
0.05

Markov Process Rate Matrix

Type: CTMC
Title: Rep_MP

Step
CalculateMeasure
Change
Hour
Analyze
State
Index Names
Economics
0
S_0
1
S_1
Transient
2
S_2
3
S_3
Steady State
4
S_4
5
S_5
n-step Probabilities
First Pass
Simulate
Absorbing States

6
S_0
S_1
S_2
S_3
S_4
S_5
Sum

Matrix Analyzed.
6 Recurrent States
1 Recurrent State Class
0 Transient States
0
1
2
S_0
S_1
S_2
0
0.1
0
0.05
0
0.08
0
0.05
0
0
0
0.05
0
0
0
0
0
0
0.05
0.15
0.13

3
S_3
0
0
0.06
0
0.05
0
0.11

4
S_4
0
0
0
0.04
0
0.05
0.09

5
S_5
0
0
0
0
0.02
0
0.02

Sum
0.1
0.13
0.11
0.09
0.07
0.05

Status
Class-1
Class-1
Class-1
Class-1
Class-1
Class-1

0
1
2
3
4
5

S_0
S_1
S_2
S_3
S_4
S_5

Embedded Markov Matrix

Expected
0
1
Time
S_0
S_1
10
0
1
7.69231 0.38462
0
9.09091
0 0.45455
11.1111
0
0
14.2857
0
0
20
0
0

2
S_2

3
S_3

4
S_4

5
S_5

0
0
0
0
0.61538
0
0
0
0 0.54545
0
0
0.55556
0 0.44444
0
0 0.71429
0 0.28571
0
0
1
0

Economic Data

Discount
Type: CTMC EconomicRate per
Title: Rep_MP Measure Hour
Cost
0.1
0
S_0
Calculate
1
S_1
2
S_2
Matrix
3
S_3
4
S_4
5
S_5

State Combined
Combined
Cost
Cost
Cost
Rate
Rate per Step
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

0
S_0
0
0
0
0
0
0

Transition Cost Matrix

1
2
S_1
S_2
0
0
0
0
0
0
0
0
0
0
0
0

on Cost Matrix
3
S_3

4
S_4
0
0
0
0
0
0

5
S_5
0
0
0
0
0
0

0
0
0
0
0
0

Steady State Analysis

Type: CTMC
Title: Rep_MP
Solve by: Inverse

0
1
2
3
4
5
S_0
S_1
S_2
S_3
S_4
S_5
Steady State (Time) 0.06973 0.13946 0.22314 0.26777 0.21421 0.08569
Transition Time

Matrix

10 7.69231 9.09091 11.1111 14.2857

20

teady State (Steps) 0.07496 0.19489 0.26385 0.25905 0.16119 0.04605

Birth-Death Results
E[Number in Population] 2.67433
E[Arrival Rate(per Hour)] 0.04651
E[Time in System (Hours)] 57.4958
E[Cost per Hour]
0

Expected
Transition
Time
10.74958

Average
Cost
rate
0

Markov Process Model Name: Rep2_MP

Define States

Type: Birth-Death
State Var.:
1
Event Var.:
1

Economic Measure = Cost

Fill Matrix
Add Transitions

State Vector
Event Vector
Define the state vector and logical conditions for feasi Define the event vector and logical conditions for feasible
Step Feas.
Step Feas.
1
1
State
5
Event
1
Feas.
1
1
1
Feas.
1
1
1
Min
0
Min
-1
Max
5Formula for state names
Max
1Formula for event names
5
6
S_5
2
3
Birth
6
1
3
1
Formula for state Cost
Definitions
0
Definitions
s1: Number in System
e1: +1 for birth, -1 for death

State-Event Transition Equations, Rates and Costs

Description:
State
1
Min
0
Max
4
0
1
0
Logic
s1
Index Name
Trans. Rate
Next
0
6 ### ###
0

State-Event Transition Equations, Rates and Costs

Description:
State
1
Min
1
Max
5
1
1
1
Logic
s1
Index Name
Trans. Rate
Next
0
6 ### ###
0.1

Index
1
2

s1
0
1

Number
Name in Population
Arrival Rate
Measure 3
S_0
0
0.1
0
S_1
1
0.08
0

Event
Min
Max

Trans. Prob.
1

Event
Min
Max
Trans. Prob.
1

1
1
1
1
Trans. Cost
0

-1
-1
0
1
Trans. Cost
0

3
4
5
6

2
3
4
5

S_2
S_3
S_4
S_5

2
3
4
5

0.06
0.04
0.02
0

0
0
0
0

Birth-Death Model
Build Matrix Model

Maximum number in system =

5
d logical conditions for feasible events.
Economic Measure = Cost
Time Measure = Hour
0
Birth Rate
0.1
0
Death Rate
0
ula for event names
Cost Rate for Items in the System =
0
Cost per Item Entering =
0
Cost per Item Leaving =
0

1
0.08
1
0.05

2
0.06
2
0.1

3
0.04
3
0.1

4
0.02
4
0.1

5
0
5
0.1

Markov Process Rate Matrix

Type: CTMC
Title: Rep2_MP

Step
CalculateMeasure
Change
Hour
Analyze
State
Index Names
Economics
0
S_0
1
S_1
Transient
2
S_2
3
S_3
Steady State
4
S_4
5
S_5
n-step Probabilities
First Pass
Simulate
Absorbing States

6
S_0
S_1
S_2
S_3
S_4
S_5
Sum

Matrix Analyzed.
6 Recurrent States
1 Recurrent State Class
0 Transient States
0
1
2
S_0
S_1
S_2
0
0.1
0
0.05
0
0.08
0
0.1
0
0
0
0.1
0
0
0
0
0
0
0.05
0.2
0.18

3
S_3
0
0
0.06
0
0.1
0
0.16

4
S_4
0
0
0
0.04
0
0.1
0.14

5
S_5
0
0
0
0
0.02
0
0.02

Sum
0.1
0.13
0.16
0.14
0.12
0.1

Status
Class-1
Class-1
Class-1
Class-1
Class-1
Class-1

0
1
2
3
4
5

S_0
S_1
S_2
S_3
S_4
S_5

Embedded Markov Matrix

Expected
0
1
Time
S_0
S_1
10
0
1
7.69231 0.38462
0
6.25
0
0.625
7.14286
0
0
8.33333
0
0
10
0
0

2
S_2

3
S_3

4
S_4

5
S_5

0
0
0
0
0.61538
0
0
0
0
0.375
0
0
0.71429
0 0.28571
0
0 0.83333
0 0.16667
0
0
1
0

Economic Data

Discount
Type: CTMC EconomicRate per
Title: Rep2_MP Measure Hour
Cost
0.1
0
S_0
Calculate
1
S_1
2
S_2
Matrix
3
S_3
4
S_4
5
S_5

State Combined
Combined
Cost
Cost
Cost
Rate
Rate per Step
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

0
S_0
0
0
0
0
0
0

Transition Cost Matrix

1
2
S_1
S_2
0
0
0
0
0
0
0
0
0
0
0
0

on Cost Matrix
3
S_3

4
S_4
0
0
0
0
0
0

5
S_5
0
0
0
0
0
0

0
0
0
0
0
0

Steady State Analysis

Type: CTMC
Title: Rep2_MP
0
1
2
3
4
5
Solve by: Inverse
S_0
S_1
S_2
S_3
S_4
S_5
Steady State (Time) 0.16609 0.33218 0.26575 0.15945 0.06378 0.01276
Transition Time
Matrix

10 7.69231

6.25 7.14286 8.33333

teady State (Steps) 0.12435 0.32332 0.31834 0.16713

Birth-Death Results
E[Number in Population] 1.66091
E[Arrival Rate(per Hour)] 0.06678
E[Time in System (Hours)] 24.8707
E[Cost per Hour]
0

10

0.0573 0.00955

Expected
Transition
Time
7.4870673

Average
Cost
rate
0