Question 1
A job shop has 3 machines. Jobs and their routes:
- Job A: M3 → M2 → M1 with times 27, 21, 12
- Job B: M1 → M2 → M3 with times 33, 28, 38
- Job C: M1 → M3 → M2 with times 15, 33, 40
What is a lower bound on the minimum makespan?
Step-by-step solution:
1. Machine load bound: 98
2. Job processing bound: 99
3. Lower bound: 99
Answer: 99
1. Machine load bound: 98
2. Job processing bound: 99
3. Lower bound: 99
Answer: 99