| CASE II:
If |
l < m |
then
a queue may or may not form |
|
|
3 |
|
|
|
| CASE IIA: If |
l < m |
and both processes are
deterministic |
|
|
then a queue will NOT
form |
|
|
|
|
|
Q = |
0 veh |
(If there is an existing
queue, it will shrink by 100 vph) |
|
|
|
|
|
|
|
|
|
l = |
400 |
|
|
|
|
m = |
500 |
vph |
|
| "events"
are usually arrivals in transportation applications |
|
|
|
|
| CASE IIB: If |
l < m |
and one of the processes
is NOT deterministic |
|
|
then a queue MAY
form. This is where we use the
queuing formulas! |
|
|
|
Q = |
? Veh |
|
|
|
|
|
|
|
|
|
l = |
400 |
|
|
|
|
m = |
500 |
vph |
|
|
|
| Whether
or not a queue forms depends on the type of arrival process (D, G, M), the
type of |
| service
process (D, G, M), and how close the arrival rate is to the service rate. |
|
|
| The
equations used to calculate queue information depend on the type of arrival |
| and
service processes encountered. Table
3.21 in the book gives these equations. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
