Question: Given this dataset for jobs that need two processes in sequence, please answer the following questions Job Processing Time A Processing Time B 1 4
Given this dataset for jobs that need two processes in sequence, please answer the following questions
| Job | Processing Time A | Processing Time B |
| 1 | 4 | 8 |
| 2 | 2 | 6 |
| 3 | 3 | 8 |
| 4 | 7 | 3 |
| 5 | 5 | 6 |
| 6 | 9 | 4 |
| 7 | 2 | 7 |
| 8 | 6 | 2 |
a) How many different schedulings does a problem of this size have? (5 points)
b) How many schedulings of a problem of this size (at most) could minimize makespan? (5 points)
c) Please compute a makespan-minimizing schedule for this problem. (10 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
