Every Halloween, the sisters of Alpha Delta Pl(ADP) pul laguter Monster Bags for children at the local hospital. Each Monster Bag com la paper bag sted with candy Each bag has a character's face drawn on it with yn hair and paper arms and legs attached For the past few years ever sisters have worked individually, puting together bags on their own but because some of the women are much beter They decide that ideal solution would be to develop a lite production line to make the bags. This way the most talented artists can focus on what they do best-drawing the characterfaces They also developed the time estimates and predecessor data for the tasks, which are also provided in the al ADP needs to make 157 bags Getting volunteers to help wont be a problem they could get all the bags done in four hours Time (seconds) 59 45 Immediate Predecessor None None Pol Wit 107 The cycle times seconds The theoretical number of workstations is Task A Draw the face on the bag B Cut out the arms and legs C Altach the arms and legs D. Cut the yarn for the hair E Attach the hair to the bag F. Fill the bag with candy G Staple the bag closed 33 54 14 None 62 27 10 AD CE F Enter the missing positional weights in the table above Using greatest positional weight and a fiebreaker rule of the most number of following tasks the task assignments for each work stations are as follows in the order they assigned based on the rules glen 21 11 11 WS #1 WS # 2 WS #3 WS #4 Seconds The actual cycle time is The efficiency for this assembly line is percent FORMAT to enter your response Work Stations. If you assign A and B to WS #1 enter your response as ACB with no spaces between There might be a workstation ne task is left to be assigned to an empty station enter none Efficiency: No decimal Round to the nearest Integer Every Halloween, the sisters of Alpha Delta Pl(ADP) pul laguter Monster Bags for children at the local hospital. Each Monster Bag com la paper bag sted with candy Each bag has a character's face drawn on it with yn hair and paper arms and legs attached For the past few years ever sisters have worked individually, puting together bags on their own but because some of the women are much beter They decide that ideal solution would be to develop a lite production line to make the bags. This way the most talented artists can focus on what they do best-drawing the characterfaces They also developed the time estimates and predecessor data for the tasks, which are also provided in the al ADP needs to make 157 bags Getting volunteers to help wont be a problem they could get all the bags done in four hours Time (seconds) 59 45 Immediate Predecessor None None Pol Wit 107 The cycle times seconds The theoretical number of workstations is Task A Draw the face on the bag B Cut out the arms and legs C Altach the arms and legs D. Cut the yarn for the hair E Attach the hair to the bag F. Fill the bag with candy G Staple the bag closed 33 54 14 None 62 27 10 AD CE F Enter the missing positional weights in the table above Using greatest positional weight and a fiebreaker rule of the most number of following tasks the task assignments for each work stations are as follows in the order they assigned based on the rules glen 21 11 11 WS #1 WS # 2 WS #3 WS #4 Seconds The actual cycle time is The efficiency for this assembly line is percent FORMAT to enter your response Work Stations. If you assign A and B to WS #1 enter your response as ACB with no spaces between There might be a workstation ne task is left to be assigned to an empty station enter none Efficiency: No decimal Round to the nearest Integer
