Question 1
A job shop has 3 machines. Jobs and their routes:
- Job A: M3 → M1 → M2 with times 17, 19, 25
- Job B: M2 → M1 → M3 with times 35, 33, 33
- Job C: M1 → M2 → M3 with times 22, 24, 26
What is a lower bound on the minimum makespan?
Step-by-step solution:
1. Machine load bound: 84
2. Job processing bound: 101
3. Lower bound: 101
Answer: 101
1. Machine load bound: 84
2. Job processing bound: 101
3. Lower bound: 101
Answer: 101