« View all new features in Mathematica 9  previous  |  next 
New in Mathematica 9Markov Chains and Queues

Simulate Different Types of Queues 

Simulate an M/M/1 queue in which customers arrive at the rate of three per hour and are served at the rate of five per hour.

In[1]:=
Click for copyable input
X
Out[1]=

Since the arrival rate is less than the service rate, the system reaches a steady state.

In[2]:=
Click for copyable input
X
Out[2]=

If the arrival rate is greater than the service rate, then the system does not reach a steady state.

In[3]:=
Click for copyable input
X
In[4]:=
Click for copyable input
X
Out[4]=

Simulate a queueing system that can hold only 12 customers.

In[5]:=
Click for copyable input
X
In[6]:=
Click for copyable input
X
Out[6]=

Simulate a queue with 20 customers in the initial state.

In[7]:=
Click for copyable input
X
In[8]:=
Click for copyable input
X
Out[8]=