Академический Документы
Профессиональный Документы
Культура Документы
Flow Lines
Types
Issues in Design and Operation
Models of Asynchronous Lines
Infinite or Finite Buffers
Models of Synchronous (Indexing) Lines
Closed-Loop Material Handling
1
Types of Flow Lines
3
Fluid Model for Deterministic Serial
Queuing System (Hall)
Suppose N single-server stations in series,
upstream
each with own unlimited queue Q1
Up to time t,
An (t ) cum. arrivals at server n s1
D n (t ) cum. departures from server n
At time t,
Ln (t ) no. of customers at server n
downstream
Q2
A (t ) D (t )
n n
Given:
n service rate of server n
n travel time from server n 1 to server n
The queues are related by:
An t D n 1 t n , 2 n N
n t , if Ln t 0
n t
n , if L t 0
n
6
Asynchronous Lines with Unlimited Buffers
c ! p0 , ki ci
i
8
Work Load Allocation
9
Work Load Allocation (cont)
The solution to this optimization problem will satisfy:
wi
*
13
Transition Diagram
0,0 0,1 0,n3 0,n3+1 0,b3 0,b3+1
TH 3 1 n2 0 p (n2 , 0)
b 1
2
If b2 = b3, throughput is maximized by putting the fastest
station (largest ) in the middle true for nonexponential
processing times as well.
15
3 Stages, No Buffer Space
0,0 1 2 3
3
0,0 0,1 0,2 1,0 1 2 3
1 2
1,0 1,1 1,2 2,0 1 2 3
0,1 1 2 3
2,0 2,1
1,1 1 2 3
p. 190: Throughput is
2,1 1 2 3
symmetric in 1, 3.
Maximize throughput 0,2 1 2 3
with 2 = max(1, 2, 3)
1,2 1 2 3 16
Multiple Stages
Unlimited buffers:
Equalize workload among stages if single server
per stage
Allocate more work per server to stations with
more servers
Limited buffers:
Faster servers (less work) in middle stations
Avoid blocking early stages, starving late stages
Allocate buffer space evenly
18
Indexing Lines
19
Unpaced Lines
0.577 0.577
Finally, E tm 1.28 1.93 1.58
Note: This value of applies to m = 10 only! Re-do for other
values of m.
23
How do we use this? (cont)
and
2 10 1.58 10 2 20 1.94 20
1
TH for the two 10-station lines
1
20 1.94 20
1
TH for the 20-station line 2 20 1.58 2 20
24
Paced Lines
where the last equality assumes that the times Ti are iid.
Note that Q() is the same as F t , the cycle time
distribution for the unpaced line. We will assume that is
set large enough so that Q() is close to 1 and fits the
right-tail distribution: (t t )
Q t exp e m
, where tm FT1 1 m1 25
Setting to achieve a specified Q()
FT Q *
1/ m
Assuming Q t exp e (t t ) ,
m
* will satisfy: * tm ln *
Q * exp e
2 ( 2.65 1.28 )
0.94
0.94 0.63
TH
2.65(0.2 )
Throughput is less than
1 E T
1