4-2 - - longest: hard to fit in- greatest number of...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 4, Part 2 Assembly Line Balancing
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Review of Part 1 In Process and Layout design we learned: types of production processes types of layouts the connections among market, product, process, and layout the trade-offs that need to be considered the product-process matrix break-even analysis applied in process selection how to design an assembly line
Background image of page 2
1. Draw a precedence diagram. 2. Calculate the cycle time and theoretical minimum number of workstations . 3. Group elements into workstations. 4. Calculate the efficiency of the line. 5. Is efficiency level acceptable ? If not, go back to step 3. How to group elements in a different way than before to improve efficiency and decrease balance delay?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Line Balancing Rules Examples: Assign tasks in order of longest task time. Assign tasks in order of greatest number of followers. Motivation: select first the eligible task that might be the largest obstacle for flexible selection
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: - longest: hard to fit in- greatest number of followers: following activities cannot be assigned earlier Application: Trial and error , no guarantee which rule is better Several other rules are also used Heuristic (intuitive) Rules (assignment preferences ) : Assigning Tasks to Workstations considering Assignment Preferences 1. Start at the first station list the eligible task (tasks with no unassigned predecessors ) 2. Check which fit in time (remaining task time is enough) 3. Select the task according to first preference 4. I case of tie check tiebreaker (second preference) 5. Continue adding eligible task that fits without going over the desired cycle time 6. When no eligible tasks fit in time, begin assigning tasks to the next workstation 7. Continue until all tasks are assigned We use a table for convenience (see next) WS Eligible Fit I.Pref. II.Pref. Assign Time Idle time 1...
View Full Document

This note was uploaded on 09/10/2010 for the course ISDS 3115 taught by Professor Woosley during the Fall '08 term at LSU.

Page1 / 6

4-2 - - longest: hard to fit in- greatest number of...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online