Professional Documents
Culture Documents
n n *
L (X )Q
i i i L (Y ) Q
i i i C(X, Y)
*
Cx = i =1
n
; Cy = i =1
n * L3(X3, Y3)
Q
i =1
i Q
i =1
i L1(X1, Y1)
𝑚 𝑛 𝑚
𝑛 𝑛 𝑚
𝑌𝑖𝑗 ≤ 𝑀. 𝑋𝑖 𝑎𝑛𝑑 𝐷𝑗 ≤ 𝐾𝑖
𝑗=1 𝑗=1 𝑖=1
For uncapacitated problem, remove the capacity constraint and treat Yij as a
weighted capacity such that sum of Yij taken over all m equals 1
Inventory
• A product layout has a low work-in-process inventory and
high finished goods inventory because production is
initiated by demand forecast.
• A process layout has a high work-in-process inventory and
low finished goods inventory.
Material handling
• Product layout can use auto-guided transport vehicles
moving in a fixed path for materials.
• Process layout require variable path forklifts.
Product vs. Process Layouts … 4
Scheduling jobs
• In process layout, jobs arrive throughout the planning
period.
• Hence a process layout requires dynamic scheduling.
Scheduling decisions are made each time a new job
arrives.
• For product layout, you have a production line. Sequencing
and timing of job flow are standardized and set when the
line is designed.
• Scheduling is unaffected by changes in demand.
Product vs. Process Layouts … 5
Line balancing
• A balanced line is when every machine in the line is
processing the job in an even flow. i.e. no machine is idle
because of having to wait for the preceding machine to
finish (no latency).
• Product layout requires line balancing and workcenter
stocking.
• When demand changes, the line has to be rebalanced.
Line 1 M1 3 M2 5
Line 2 M1 5 M2 3
Line 3 M1 4 M2 8 M3 5
M1 5 M2 3
Line 4 M5 5
M3 4 M4 8
Line 1 M1 3 M2 5
20/hr 12/hr
Line 1 M1 3 M2 5 M2 5
M1 3 M2 5 M2 5
M1 3 60/hr M2 5 60/hr
Line 1 M1 3 M2 5
20/hr 12/hr
t2
At optimum S = H t = H ( R1 − R2 )
2
2S
topt =
H ( R1 − R2 )
19 (c) 2016 Milind Padalkar 25 September 2019
Line balancing policy
Cost
Ht
Note
topt is cost-optimized interval S
It does not ensure zero WIP
topt Time
Line 1 M1 3 M2 5
12/hr
Rt ~ N(R , σ2)
Stochastic = random behavior over time _
M1 runs at rate Rt which follows some distribution: Assume Rt ~ N(R , σ2)
Assume total duration t* is divided into n equal intervals of Δt
Rate Rt is drawn from the normal distribution n times
i n
H t = Holding Cost upto time t = H ( R j − R2 )t t
i =1 j =1
n i
At optimum S = H t = H ( R j − R2 )t t
i =1 j =1
n 2S
topt ; with std dev 2
(n + 1) H ( R − R2 )
Line 1 M1 3 M2 5
Rt ~ N(R1, σ2) Rt ~ N(R2, σ2)
Machines
Enter
Worker 2
Worker
Worker 1 3
Exit
Assembly
4 6 7 9
Machines in
5 8
process
layout 2 10 12
1 3 11
A B C Raw materials
A job shop that can become cellular … 2
Machines
Parts 1 2 3 4 5 6 7 8 9 10 11 12
A x x x x x
B x x x x
C x x x
D x x x x x
E x x x
F x x x
G x x x x
H x x x
Clustering algorithm using hashing … 2
Machines
Parts 1 2 4 3 5 6 7 8 9 10 11 12
A x x x x x
B x x x x
C x x x
D x x x x x
E x x x
F x x x
G x x x x
H x x x
Clustering algorithm using hashing … 3
Machines
Parts 1 2 4 3 5 6 7 8 9 10 11 12
A x x x x x
D x x x x x
B x x x x
C x x x
E x x x
F x x x
G x x x x
H x x x
Clustering algorithm using hashing … 4
Machines
Parts 1 2 4 8 3 5 6 7 9 10 11 12
A x x x x x
D x x x x x
B x x x x
C x x x
E x x x
F x x x
G x x x x
H x x x
Clustering algorithm using hashing … 5
Machines
Parts 1 2 4 8 3 5 6 7 9 10 11 12
A x x x x x
D x x x x x
F x x x
B x x x x
C x x x
E x x x
G x x x x
H x x x
Clustering algorithm using hashing … 6
Machines
Parts 1 2 4 8 10 3 5 6 7 9 11 12
A x x x x x
D x x x x x
F x x x
B x x x x
C x x x
E x x x
G x x x x
H x x x
Clustering algorithm using hashing … 7
Machines
Parts 1 2 4 8 10 3 6 9 5 7 11 12
A x x x x x
D x x x x x Cell 1
F x x x
C x x x Cell 2
G x x x x
B x x x x
E x x x
H Cell 3 x x x
Cellular layout: No longer a job shop
Assembly
8 10 9 12
11
4 Cell1 Cell 2 6 Cell 3
7
2 1 3 5
Raw materials A C B
Each of A, B, C now visits only one area, minimizing jumping.
Advantages of Cellular Layouts
Punch
Saws Milling Press Drills
Saws 18 40 30
Milling 18 38 75
Punch Press 40 38 22
Drills 30 75 22