The production of a particular product requires a total of 11 tasks. The predecessor relationships are given in the following table. Assume that the company operates X hours per week. The company wants to produce Y units per week from that product. (Before solving the question, select an integer value for the parameters from the given interval, fill in the following table and copy only the 1st&3rd columns into your answer sheet. Otherwise, the solution cannot be evaluated.) (Before solving the question, select a different integer processing time for each of the tasks from the interval [10;30] minutes, fill in the following table and copy only the 1st&3rd columns it into your answer sheet. Otherwise, the solution cannot be evaluated.) a) Draw the precedence network diagram. b) Compute the cycle time. c) Compute the minimum no of workstations required. d) By using "Kilbridge \& Wester" heuristic, which task(s) can be assigned to which workstation? Use the format of the given empty task \& workstation assignment table on the next page. In this table, you should also add horizontal lines to seperate the workstations (as we did in the lecture and class). If there is more than one eligible task, show the most eligible task based on the heuristic and circle that task. If you cannot assign an eligible task, put a cross sign to indicate that it cannot be assigned to that workstation. In case of a tie, use the following tie-breaker rule: Always select the task which comes first in the alphabet first. (For instance, if there is a tie between B and E, then B is preferable to E ). e) Compute the line efficiency. The production of a particular product requires a total of 11 tasks. The predecessor relationships are given in the following table. Assume that the company operates X hours per week. The company wants to produce Y units per week from that product. (Before solving the question, select an integer value for the parameters from the given interval, fill in the following table and copy only the 1st&3rd columns into your answer sheet. Otherwise, the solution cannot be evaluated.) (Before solving the question, select a different integer processing time for each of the tasks from the interval [10;30] minutes, fill in the following table and copy only the 1st&3rd columns it into your answer sheet. Otherwise, the solution cannot be evaluated.) a) Draw the precedence network diagram. b) Compute the cycle time. c) Compute the minimum no of workstations required. d) By using "Kilbridge \& Wester" heuristic, which task(s) can be assigned to which workstation? Use the format of the given empty task \& workstation assignment table on the next page. In this table, you should also add horizontal lines to seperate the workstations (as we did in the lecture and class). If there is more than one eligible task, show the most eligible task based on the heuristic and circle that task. If you cannot assign an eligible task, put a cross sign to indicate that it cannot be assigned to that workstation. In case of a tie, use the following tie-breaker rule: Always select the task which comes first in the alphabet first. (For instance, if there is a tie between B and E, then B is preferable to E ). e) Compute the line efficiency