Question 1
A job shop has 3 machines. Jobs and their routes:
- Job A: M3 → M1 → M2 with times 10, 35, 11
- Job B: M1 → M3 → M2 with times 29, 12, 34
- Job C: M3 → M2 → M1 with times 14, 37, 39
What is a lower bound on the minimum makespan?
Step-by-step solution:
1. Machine load bound: 103
2. Job processing bound: 90
3. Lower bound: 103
Answer: 103
1. Machine load bound: 103
2. Job processing bound: 90
3. Lower bound: 103
Answer: 103