for a) The options for tasks given are:

1. a,b

a

a,c

2. b,d

e,b,c

e,d,c,b

3. f,c,g

e,g,c

e,c,f

4. g,h

d,e

c,d

manager wants to assign tasks to workstations to achieve an hourly output rate of 30 units. Assume that the shop works 60 minutes p6_2algo9.jpg no breaks). .75 .28 1.75 .54 1.33 .20 a b d h 1.67 .89 g a. Assign the tasks shown in the above precedence network (times are on the nodes and are in minutes) to workstations using the following heuristic rules: (i) "Assign the task with the most followers." (ii) Tiebreaker: "Assign the task with the longest time." (Round the intermediate calculations and final answers to 2 decimal places.) Idle Time Workstations 1 2 Task a (Click to select) (Click to select) (Click to select) b. What is the efficiency? (Round the intermediate calculations to 2 decimal places. Round the final answer to 1 decimal place.) Efficiency %