Fill in the table using the information below. Clearly state the decision rule you use and complete the below table using the selected rule. Decision
Fill in the table using the information below. Clearly state the decision rule you use and complete the below table using the selected rule.
Decision Rule: | |||||
Work Element | Cumulative | Idle Time | |||
Station | Candidate(s) | Choice | Time (sec) | Time (sec) | (c = ? sec) |
We use the longest task time (LPT) heuristic judgement rule to balance the assembly line.
Step 1: Sort the tasks according to their completion times.
G (16) is better than A (25), C (20), B (18), E (12), H (12), F (8), and D. (5)
Step 2: Assign tasks to stations, beginning with the top-ranked assignment. Station 1 (total time: 53 seconds): G (16), A (25), and E (12). Station 2's sequence is C (20) > H (12) > F (8) (total time: 40 seconds). (Total time: 23 seconds) Station 3: B (18) > D (5)
Step 3: Determine how much time each station has been idle.
Station 1: Cycle time of 40 seconds minus total time of 53 seconds equals 13 seconds (no idle time) Station 2: 40 minus 40 equals 0 seconds (no idle time) Station 3: 40 seconds divided by 23 seconds equals 17 seconds (idle time)
Step 4: Determine which tasks can be transferred to the vacant stations.
1st Station: None No station two E (12) or F (8) or H at Station 3 (12) Step 5: Decide which job should be moved to the idle station based on its task time.
Among the available tasks, E (12) has the longest task time.
Recalculating the total time for each station is step six.
Station 1 (total time: 53 seconds): G (16), A (25), and E (12). Station 2's sequence is C (20) > H (12) > F (8) (total time: 40 seconds). Station 3 (total time: 35 seconds): B (18), D (5), and E (12).
Step 7: Determine how much time each station has been idle.
Station 1: 40 minus 53 equals -13 seconds (no idle time) Station 2: 40 minus 40 equals 0 seconds (no idle time) Station 3: 40 minus 35 equals 5 seconds (idle time) Step 8: Repeat steps 4 through 7 until every vacant station is occupied.
1st Station: None No station two Station 3: F (8) or H (12) Among the available tasks, F (8) has the next-highest task time.
In order to create 90 units per hour, the final balanced assembly line with three stations and the LPT heuristic decision rule is as follows:
Station 1 (total time: 53 seconds): G (16), A (25), and E (12). Station 2's sequence is C (20) > H (12) > F (8) (total time: 40 seconds). Station 3: B (18) > D (5) > F (8) (30 seconds total)
The assembly line's cycle time is 40 seconds, which satisfies the necessary production of 90 units per hour.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started