Formulas:
Introduction
M/M/1 Queues in Series
M/M/1 with Load and Unload
M/M/1 with Priority Classes
M/M/1 with Rework
M/M/1 with Scrap
M/M/s Queue
M/G/1 Queue
Formula References
|
 |
 |
M/M/1 Queues in Series with Scrap
We demonstrate whole-lot scrapping
here only, so that we may compare with analytic results
for M/M/1 queues in series. Suppose we have three
workstations in series, with some scrap occurring after
steps one and two. If the interarrival times to the first
workstation are exponentially distributed, and all process
times are exponentially distributed, then we can analyze the
limiting expected time in queue separately for
each queue, as before. The only modification is that the
arrival rate to each queue changes, as some lots are
removed due to scrapping.
Let the arrival rate to
workstation one be l1
= 1.0 lots per hour. If approximately one out of every ten
lots is scrapped during processing at workstation one,
then the arrival rate to workstation two is
l2
= l1
* 0.9 = 0.9 lots per hour. If approximately one out of
every five lots is scrapped during processing at
workstation two, then the arrival rate to workstation
three is l3
= l2
* 0.8 = 0.72 lots per hour. Suppose that the three
processing rates are m1
= 2.5, m2 = 2.0,
and m3 = 2.5 lots per hour,
and that each workstations consists
of a single machine. Then, the total limiting expected
system cycle time should be
(m1
- l1)-1 + (m2
- l2)-1 + (m3
- l3)-1 = 0.67 + 0.91
+ 0.56 = 2.14 hours
|