Question 1
A job shop has 3 machines. Jobs and their routes:
- Job A: M1 → M3 → M2 with times 38, 39, 31
- Job B: M3 → M1 → M2 with times 20, 28, 12
- Job C: M1 → M2 → M3 with times 20, 23, 20
What is a lower bound on the minimum makespan?
Step-by-step solution:
1. Machine load bound: 86
2. Job processing bound: 108
3. Lower bound: 108
Answer: 108
1. Machine load bound: 86
2. Job processing bound: 108
3. Lower bound: 108
Answer: 108