Question: Flag question Question 7 Award out for a new pro plans to use this production line 8 hours a day in order to meet a

Flag question Question 7 Award out for a new pro
Flag question Question 7 Award out for a new pro
Flag question Question 7 Award out for a new pro plans to use this production line 8 hours a day in order to meet a schedule of 400 per Thessary to produce this product are detailed in the table below. Time Task Predecessor (seconds) 50 & 36 26 D 22 E BD 70 F CE 30 (pt) What is the required yde time in seconds) in order to meet the schedule? itp What is the theoretical minimum number of workstations needed to meet the schedule? (4 pe) Assign tasks to workstations using the longest processing time heuristic and if there is a tie break the ties according to alphabeti leirtasks and Fboth are eligible and have the same number of following tasks, then choose Efirst). Work Station includes the tasks difp) Work Station 2 includes the tasks: Time Predecessor seconds) A A 16 20 D D 70 CE 30 If powrut is the required bycle time in second in order to meet the schedule? What is the theoretical minimum number of workstations needed to meet the schedule? ITP Anson tanks to workstations using the lowest processing time heuristic and if there is a tie break the ties according to the order Ness and both are eligible and have the same number of following tasks, then choose first. Work Station 1 Includes the pe Work Station includes the tasks: ftpt) Work Station 3 includes the tasks a tp Work Stations includes the tasks: 12 pts) What is the total dle time of the balance obtained in part d? m 2 pts) What is the efficiency in percent) or the balance obtained in part d? (enter your response as a whole number

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!