SlideShare a Scribd company logo
1 of 37
ASSEMBLY LINE BALANCING
Module 1
08.8.01: Facilities Planning & Management
ASSEMBLY-LINE BALANCING
 Situation: Assembly-line production.
 Many tasks must be performed, and the sequence is
flexible
 Parts at each station same time
 Tasks take different amounts of time
 How to give everyone enough, but not too much work for
the limited time.
PRODUCT-ORIENTED LAYOUT
Belt Conveyor
Operations
A
PRECEDENCE DIAGRAM
Draw precedence graph
(times in minutes)
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
LEGAL ARRANGEMENTS
 Feasible : AC|BD|EG|FH|IJ
 ABG|CDE|FHI|J or C|ADB|FG|EHI|J
 NOT feasible : BAG|DCH|EFJ|I
 DAC|HFE|GBJ|I
A
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
LEGAL ARRANGEMENTS
 AC|BD|EG|FH|IJ = max(25,15,23,15,19) = 25
 ABG|CDE|FHI|J = max(40,23,27,7) = 40
 C|ADB|FG|EHI|J = max(5,35,18,32,7) = 35
A
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
AC BD EG FH IJ
CYCLE TIME
 The more units you want to produce per hour, the
less time a part can spend at each station.
 Cycle time = time spent at each spot
 C = 800 min / 32 = 25 min
 800 min = 13:20
C =
Production Time in each day
Required output per day (in units)
NUMBER OF WORKSTATIONS
 Given required cycle time, find out the theoretical
minimum number of stations
 N = 97 / 25 = 3.88 = 4 (must round up)
N =
Sum of task times (T)
Cycle Time (C)
ASSIGNMENTS
Assign tasks by choosing tasks:
 with largest number of following tasks
OR
 by longest time to complete
Break ties by using the other rule
NUMBER OF FOLLOWING TASKS
Nodes # after
C 6
D 5
A 4
B,E,F 3
G,H 2
I 1
Choose C first, then, if possible,
add D to it, then A, if possible.
A
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
PRECEDENCE DIAGRAM
Draw precedence graph
(times in seconds)
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
NUMBER OF FOLLOWING TASKS
Nodes # after
A 4
B,E,F 3
G,H 2
I 1
A could not be added to first
station, so a new station must be
created with A.
B, E, F all have 3 stations after,
so use tiebreaker rule: time.
B = 5
E = 8
F = 3
Use E, then B, then F.
A
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
PRECEDENCE DIAGRAM
E cannot be added to A, but E can be added to C&D.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
PRECEDENCE DIAGRAM
Next priority B can be added to A.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
PRECEDENCE DIAGRAM
Next priority B can be added to A.
Next priority F can’t be added to either.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
NUMBER OF FOLLOWING TASKS
Nodes # after
G,H2
I 1 G and H tie on number coming after.
G takes 15, H is 12, so G goes first.
A
PRECEDENCE DIAGRAM
G can be added to F.
H cannot be added.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
PRECEDENCE DIAGRAM
I is next, and can be added to H, but J cannot be added
also.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
PRECEDENCE REQUIREMENTS
Why not put J with F&G?
A
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
AB CDE
FG J
HI
CALCULATE EFFICIENCY
 We know that at least 4 workstations will be
needed. We needed 5.
 = 97 / ( 5 * 25 ) = 0.776
 We are paying for 125 minutes of work, where it
only takes 97.
Efficiencyt =
Sum of task times (T)
Actual no. of WS * Cycle Time
A
LONGEST FIRST
Try choosing longest activities first.
A is first, then G, which can’t be added to A.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST
H and I both take 12, but H has more coming after it,
then add I.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST
D is next. We could combine it with G, which we’ll do later. E is next,
so for now combine D&E, but we could have combined E&G.
We’ll also try that later.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST
J is next, all alone, followed by C and B.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
LONGEST FIRST
F is last. We end up with 5 workstations.
3
A
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
7
12
CT = 25, so efficiency is again
Eff = 97/(5*25) = 0.776
A
LONGEST FIRST- COMBINE E&G
Go back and try combining G and E instead of D and E.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST- COMBINE E&G
J is next, all alone. C is added to D, and B is added to
A.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST- COMBINE E&G
F can be added to C&D. Five WS again. CT is again 25,
so efficiency is again 0.776
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST - COMBINE D&G
Back up and combine D&G. No precedence violation.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST - COMBINE D&G
Unhook H&I so J isn’t stranded again, I&J is 19, that’s better than 7.
E&H get us to 20. This is feeling better, maybe?
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
LONGEST FIRST - COMBINE D&G
5 Again! CT is again 25, so efficiency is again 97/(5*25) =
0.776
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
CAN WE DO BETTER?
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
A
CAN WE DO BETTER?
If we have to use 5 stations, we can get a solution with
CT = 20.
C
F
D
B
E
H
G
I J
20
5
15
12
5 10
8
3
7
12
CALCULATE EFFICIENCY
 With 5 WS at CT = 20
 = 97 / ( 5 * 20 ) = 0.97
 We are paying for 100 minutes of work, where it
only takes 97.
Efficiencyt =
Sum of task times (T)
Actual # WS * Cycle Time
OUTPUT AND LABOR COSTS
 With 20 min CT, and 800 minute workday
 Output = 800 min / 20 min/unit = 40 units
 Don’t need to work 800 min
 Goal 32 units: 32 * 20 = 640 min/day
 5 workers * 640 min = 3,200 labor min.
 We were trying to achieve
 4 stations * 800 min = 3,200 labor min.
 Same labor cost, but more workers on shorter
workday
HANDLING LONG TASKS
 Long tasks make it hard to get efficient
combinations.
 Consider splitting tasks, if physically possible.
 If not:
 Parallel workstations
 use skilled (faster) worker to speed up
SUMMARY
 Compute desired cycle time, based on Market
Demand, and total time of work needed
 Methods to use:
 Largest first, most following steps, trial and error
 Compute efficiency of solutions
 A shorter CT can sometimes lead to greater
efficiencies
 Changing CT affected length of work day, looked at
labor costs

More Related Content

What's hot

Chapter 2 line_balancing no pics
Chapter 2 line_balancing no picsChapter 2 line_balancing no pics
Chapter 2 line_balancing no pics
Nirav Jadav
 

What's hot (20)

Man and machine chart
Man and machine chartMan and machine chart
Man and machine chart
 
Types of layout
Types of layoutTypes of layout
Types of layout
 
Line balancing
Line balancingLine balancing
Line balancing
 
79971255 assembly-line-balancing
79971255 assembly-line-balancing79971255 assembly-line-balancing
79971255 assembly-line-balancing
 
Assembly Line Production Introduction
Assembly Line Production   IntroductionAssembly Line Production   Introduction
Assembly Line Production Introduction
 
Assembly Line Balancing -Example
Assembly Line Balancing -ExampleAssembly Line Balancing -Example
Assembly Line Balancing -Example
 
Types of Manufacturing system
Types of Manufacturing systemTypes of Manufacturing system
Types of Manufacturing system
 
Line balancing
Line balancingLine balancing
Line balancing
 
Production Planning and Control
Production Planning and ControlProduction Planning and Control
Production Planning and Control
 
Production planning control ppt
Production planning control pptProduction planning control ppt
Production planning control ppt
 
Chapter 2 line_balancing no pics
Chapter 2 line_balancing no picsChapter 2 line_balancing no pics
Chapter 2 line_balancing no pics
 
Time study
Time studyTime study
Time study
 
Lean Manufacturing
Lean ManufacturingLean Manufacturing
Lean Manufacturing
 
travel chart for plant layout
travel chart for plant layouttravel chart for plant layout
travel chart for plant layout
 
Flow process chart
Flow process chartFlow process chart
Flow process chart
 
Kanban
KanbanKanban
Kanban
 
Job shop scheduling
Job shop schedulingJob shop scheduling
Job shop scheduling
 
Types of loading, production & operations management
Types of loading, production & operations managementTypes of loading, production & operations management
Types of loading, production & operations management
 
Operations Management : Line Balancing
Operations Management : Line BalancingOperations Management : Line Balancing
Operations Management : Line Balancing
 
Assembly Line Balancing | Case Study
Assembly Line Balancing | Case StudyAssembly Line Balancing | Case Study
Assembly Line Balancing | Case Study
 

Similar to Assembly line balancing (8)

Sequencing
SequencingSequencing
Sequencing
 
Critical path analysis
Critical path analysisCritical path analysis
Critical path analysis
 
Sequencing problems & mathematical Solution
Sequencing problems  &  mathematical Solution Sequencing problems  &  mathematical Solution
Sequencing problems & mathematical Solution
 
Tutorial mathematical equation
Tutorial mathematical equationTutorial mathematical equation
Tutorial mathematical equation
 
Assembly Line Balancing
Assembly Line BalancingAssembly Line Balancing
Assembly Line Balancing
 
Assly linbalance
Assly linbalance Assly linbalance
Assly linbalance
 
Bode Plot Notes Step by Step
Bode Plot Notes Step by StepBode Plot Notes Step by Step
Bode Plot Notes Step by Step
 
Process layout Q&A
Process layout Q&AProcess layout Q&A
Process layout Q&A
 

More from MANJUNATH N

More from MANJUNATH N (20)

Energy conservation boiler
Energy conservation boilerEnergy conservation boiler
Energy conservation boiler
 
Stoichiometric calculations
Stoichiometric calculationsStoichiometric calculations
Stoichiometric calculations
 
Introduction to stoichiometry
Introduction to stoichiometryIntroduction to stoichiometry
Introduction to stoichiometry
 
Materials selection for Design
Materials selection for DesignMaterials selection for Design
Materials selection for Design
 
Engineering design
Engineering designEngineering design
Engineering design
 
Introduction to Engineering Design
Introduction to Engineering DesignIntroduction to Engineering Design
Introduction to Engineering Design
 
Turbines
TurbinesTurbines
Turbines
 
Steam boiler
Steam boilerSteam boiler
Steam boiler
 
Gear drives
Gear drivesGear drives
Gear drives
 
Alloys
AlloysAlloys
Alloys
 
Machining
MachiningMachining
Machining
 
Manufacturing process
Manufacturing process Manufacturing process
Manufacturing process
 
Clutches & brakes
Clutches & brakesClutches & brakes
Clutches & brakes
 
Belt, rope and chain drives
Belt, rope and chain drivesBelt, rope and chain drives
Belt, rope and chain drives
 
Gear and Gear trains
Gear and Gear trainsGear and Gear trains
Gear and Gear trains
 
Material Handling
Material HandlingMaterial Handling
Material Handling
 
Warehousing 2
Warehousing 2Warehousing 2
Warehousing 2
 
Industrial aaventilation
Industrial aaventilationIndustrial aaventilation
Industrial aaventilation
 
Industrial lighting
Industrial lightingIndustrial lighting
Industrial lighting
 
Facilities systems
Facilities systemsFacilities systems
Facilities systems
 

Recently uploaded

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
ssuser89054b
 
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak HamilCara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Kandungan 087776558899
 
Introduction to Robotics in Mechanical Engineering.pptx
Introduction to Robotics in Mechanical Engineering.pptxIntroduction to Robotics in Mechanical Engineering.pptx
Introduction to Robotics in Mechanical Engineering.pptx
hublikarsn
 
Standard vs Custom Battery Packs - Decoding the Power Play
Standard vs Custom Battery Packs - Decoding the Power PlayStandard vs Custom Battery Packs - Decoding the Power Play
Standard vs Custom Battery Packs - Decoding the Power Play
Epec Engineered Technologies
 
"Lesotho Leaps Forward: A Chronicle of Transformative Developments"
"Lesotho Leaps Forward: A Chronicle of Transformative Developments""Lesotho Leaps Forward: A Chronicle of Transformative Developments"
"Lesotho Leaps Forward: A Chronicle of Transformative Developments"
mphochane1998
 
Kuwait City MTP kit ((+919101817206)) Buy Abortion Pills Kuwait
Kuwait City MTP kit ((+919101817206)) Buy Abortion Pills KuwaitKuwait City MTP kit ((+919101817206)) Buy Abortion Pills Kuwait
Kuwait City MTP kit ((+919101817206)) Buy Abortion Pills Kuwait
jaanualu31
 

Recently uploaded (20)

Augmented Reality (AR) with Augin Software.pptx
Augmented Reality (AR) with Augin Software.pptxAugmented Reality (AR) with Augin Software.pptx
Augmented Reality (AR) with Augin Software.pptx
 
Ground Improvement Technique: Earth Reinforcement
Ground Improvement Technique: Earth ReinforcementGround Improvement Technique: Earth Reinforcement
Ground Improvement Technique: Earth Reinforcement
 
Signal Processing and Linear System Analysis
Signal Processing and Linear System AnalysisSignal Processing and Linear System Analysis
Signal Processing and Linear System Analysis
 
Max. shear stress theory-Maximum Shear Stress Theory ​ Maximum Distortional ...
Max. shear stress theory-Maximum Shear Stress Theory ​  Maximum Distortional ...Max. shear stress theory-Maximum Shear Stress Theory ​  Maximum Distortional ...
Max. shear stress theory-Maximum Shear Stress Theory ​ Maximum Distortional ...
 
Design For Accessibility: Getting it right from the start
Design For Accessibility: Getting it right from the startDesign For Accessibility: Getting it right from the start
Design For Accessibility: Getting it right from the start
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
 
Theory of Time 2024 (Universal Theory for Everything)
Theory of Time 2024 (Universal Theory for Everything)Theory of Time 2024 (Universal Theory for Everything)
Theory of Time 2024 (Universal Theory for Everything)
 
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak HamilCara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
 
Introduction to Robotics in Mechanical Engineering.pptx
Introduction to Robotics in Mechanical Engineering.pptxIntroduction to Robotics in Mechanical Engineering.pptx
Introduction to Robotics in Mechanical Engineering.pptx
 
School management system project Report.pdf
School management system project Report.pdfSchool management system project Report.pdf
School management system project Report.pdf
 
HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx
HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptxHOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx
HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx
 
UNIT 4 PTRP final Convergence in probability.pptx
UNIT 4 PTRP final Convergence in probability.pptxUNIT 4 PTRP final Convergence in probability.pptx
UNIT 4 PTRP final Convergence in probability.pptx
 
S1S2 B.Arch MGU - HOA1&2 Module 3 -Temple Architecture of Kerala.pptx
S1S2 B.Arch MGU - HOA1&2 Module 3 -Temple Architecture of Kerala.pptxS1S2 B.Arch MGU - HOA1&2 Module 3 -Temple Architecture of Kerala.pptx
S1S2 B.Arch MGU - HOA1&2 Module 3 -Temple Architecture of Kerala.pptx
 
Introduction to Data Visualization,Matplotlib.pdf
Introduction to Data Visualization,Matplotlib.pdfIntroduction to Data Visualization,Matplotlib.pdf
Introduction to Data Visualization,Matplotlib.pdf
 
Convergence of Robotics and Gen AI offers excellent opportunities for Entrepr...
Convergence of Robotics and Gen AI offers excellent opportunities for Entrepr...Convergence of Robotics and Gen AI offers excellent opportunities for Entrepr...
Convergence of Robotics and Gen AI offers excellent opportunities for Entrepr...
 
Standard vs Custom Battery Packs - Decoding the Power Play
Standard vs Custom Battery Packs - Decoding the Power PlayStandard vs Custom Battery Packs - Decoding the Power Play
Standard vs Custom Battery Packs - Decoding the Power Play
 
Memory Interfacing of 8086 with DMA 8257
Memory Interfacing of 8086 with DMA 8257Memory Interfacing of 8086 with DMA 8257
Memory Interfacing of 8086 with DMA 8257
 
"Lesotho Leaps Forward: A Chronicle of Transformative Developments"
"Lesotho Leaps Forward: A Chronicle of Transformative Developments""Lesotho Leaps Forward: A Chronicle of Transformative Developments"
"Lesotho Leaps Forward: A Chronicle of Transformative Developments"
 
Kuwait City MTP kit ((+919101817206)) Buy Abortion Pills Kuwait
Kuwait City MTP kit ((+919101817206)) Buy Abortion Pills KuwaitKuwait City MTP kit ((+919101817206)) Buy Abortion Pills Kuwait
Kuwait City MTP kit ((+919101817206)) Buy Abortion Pills Kuwait
 
8th International Conference on Soft Computing, Mathematics and Control (SMC ...
8th International Conference on Soft Computing, Mathematics and Control (SMC ...8th International Conference on Soft Computing, Mathematics and Control (SMC ...
8th International Conference on Soft Computing, Mathematics and Control (SMC ...
 

Assembly line balancing

  • 1. ASSEMBLY LINE BALANCING Module 1 08.8.01: Facilities Planning & Management
  • 2. ASSEMBLY-LINE BALANCING  Situation: Assembly-line production.  Many tasks must be performed, and the sequence is flexible  Parts at each station same time  Tasks take different amounts of time  How to give everyone enough, but not too much work for the limited time.
  • 4. A PRECEDENCE DIAGRAM Draw precedence graph (times in minutes) C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 5. LEGAL ARRANGEMENTS  Feasible : AC|BD|EG|FH|IJ  ABG|CDE|FHI|J or C|ADB|FG|EHI|J  NOT feasible : BAG|DCH|EFJ|I  DAC|HFE|GBJ|I A C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 6. LEGAL ARRANGEMENTS  AC|BD|EG|FH|IJ = max(25,15,23,15,19) = 25  ABG|CDE|FHI|J = max(40,23,27,7) = 40  C|ADB|FG|EHI|J = max(5,35,18,32,7) = 35 A C F D B E H G I J 20 5 15 12 5 10 8 3 7 12 AC BD EG FH IJ
  • 7. CYCLE TIME  The more units you want to produce per hour, the less time a part can spend at each station.  Cycle time = time spent at each spot  C = 800 min / 32 = 25 min  800 min = 13:20 C = Production Time in each day Required output per day (in units)
  • 8. NUMBER OF WORKSTATIONS  Given required cycle time, find out the theoretical minimum number of stations  N = 97 / 25 = 3.88 = 4 (must round up) N = Sum of task times (T) Cycle Time (C)
  • 9. ASSIGNMENTS Assign tasks by choosing tasks:  with largest number of following tasks OR  by longest time to complete Break ties by using the other rule
  • 10. NUMBER OF FOLLOWING TASKS Nodes # after C 6 D 5 A 4 B,E,F 3 G,H 2 I 1 Choose C first, then, if possible, add D to it, then A, if possible. A C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 11. A PRECEDENCE DIAGRAM Draw precedence graph (times in seconds) C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 12. NUMBER OF FOLLOWING TASKS Nodes # after A 4 B,E,F 3 G,H 2 I 1 A could not be added to first station, so a new station must be created with A. B, E, F all have 3 stations after, so use tiebreaker rule: time. B = 5 E = 8 F = 3 Use E, then B, then F. A C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 13. A PRECEDENCE DIAGRAM E cannot be added to A, but E can be added to C&D. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 14. A PRECEDENCE DIAGRAM Next priority B can be added to A. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 15. A PRECEDENCE DIAGRAM Next priority B can be added to A. Next priority F can’t be added to either. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 16. NUMBER OF FOLLOWING TASKS Nodes # after G,H2 I 1 G and H tie on number coming after. G takes 15, H is 12, so G goes first.
  • 17. A PRECEDENCE DIAGRAM G can be added to F. H cannot be added. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 18. A PRECEDENCE DIAGRAM I is next, and can be added to H, but J cannot be added also. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 19. PRECEDENCE REQUIREMENTS Why not put J with F&G? A C F D B E H G I J 20 5 15 12 5 10 8 3 7 12 AB CDE FG J HI
  • 20. CALCULATE EFFICIENCY  We know that at least 4 workstations will be needed. We needed 5.  = 97 / ( 5 * 25 ) = 0.776  We are paying for 125 minutes of work, where it only takes 97. Efficiencyt = Sum of task times (T) Actual no. of WS * Cycle Time
  • 21. A LONGEST FIRST Try choosing longest activities first. A is first, then G, which can’t be added to A. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 22. A LONGEST FIRST H and I both take 12, but H has more coming after it, then add I. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 23. A LONGEST FIRST D is next. We could combine it with G, which we’ll do later. E is next, so for now combine D&E, but we could have combined E&G. We’ll also try that later. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 24. A LONGEST FIRST J is next, all alone, followed by C and B. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 25. LONGEST FIRST F is last. We end up with 5 workstations. 3 A C F D B E H G I J 20 5 15 12 5 10 8 7 12 CT = 25, so efficiency is again Eff = 97/(5*25) = 0.776
  • 26. A LONGEST FIRST- COMBINE E&G Go back and try combining G and E instead of D and E. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 27. A LONGEST FIRST- COMBINE E&G J is next, all alone. C is added to D, and B is added to A. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 28. A LONGEST FIRST- COMBINE E&G F can be added to C&D. Five WS again. CT is again 25, so efficiency is again 0.776 C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 29. A LONGEST FIRST - COMBINE D&G Back up and combine D&G. No precedence violation. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 30. A LONGEST FIRST - COMBINE D&G Unhook H&I so J isn’t stranded again, I&J is 19, that’s better than 7. E&H get us to 20. This is feeling better, maybe? C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 31. A LONGEST FIRST - COMBINE D&G 5 Again! CT is again 25, so efficiency is again 97/(5*25) = 0.776 C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 32. A CAN WE DO BETTER? C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 33. A CAN WE DO BETTER? If we have to use 5 stations, we can get a solution with CT = 20. C F D B E H G I J 20 5 15 12 5 10 8 3 7 12
  • 34. CALCULATE EFFICIENCY  With 5 WS at CT = 20  = 97 / ( 5 * 20 ) = 0.97  We are paying for 100 minutes of work, where it only takes 97. Efficiencyt = Sum of task times (T) Actual # WS * Cycle Time
  • 35. OUTPUT AND LABOR COSTS  With 20 min CT, and 800 minute workday  Output = 800 min / 20 min/unit = 40 units  Don’t need to work 800 min  Goal 32 units: 32 * 20 = 640 min/day  5 workers * 640 min = 3,200 labor min.  We were trying to achieve  4 stations * 800 min = 3,200 labor min.  Same labor cost, but more workers on shorter workday
  • 36. HANDLING LONG TASKS  Long tasks make it hard to get efficient combinations.  Consider splitting tasks, if physically possible.  If not:  Parallel workstations  use skilled (faster) worker to speed up
  • 37. SUMMARY  Compute desired cycle time, based on Market Demand, and total time of work needed  Methods to use:  Largest first, most following steps, trial and error  Compute efficiency of solutions  A shorter CT can sometimes lead to greater efficiencies  Changing CT affected length of work day, looked at labor costs