Job Shop Scheduling - Intermediate Level: tricky scenarios handling Job Shop Scheduling INTERMEDIATE

This expert challenge 📈 worksheet focuses on Job Shop Scheduling - a key topic in Scheduling. You'll solve 20 intermediate-level problems (Worksheet 5 of 10). The primary focus is on tricky scenarios handling. Master how to solve job shop scheduling, job shop scheduling tricks, and job shop scheduling shortcut methods through systematic practice.

📝 Worksheet 5 of 10 • 20 questions • ⏱️ Estimated time: 20 minutes • 🎯 Intermediate level

What you'll learn in this worksheet:
Your progress through Job Shop Scheduling
Worksheet 5 of 10 (44% complete)

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

Question 2

A job shop has 3 machines. Jobs and their routes: - Job A: M2 → M3 → M1 with times 15, 14, 36 - Job B: M3 → M1 → M2 with times 21, 28, 36 - Job C: M1 → M3 → M2 with times 34, 36, 16 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 98
2. Job processing bound: 86
3. Lower bound: 98

Answer: 98

Question 3

A job shop has 3 machines. Jobs and their routes: - Job A: M3 → M2 → M1 with times 21, 33, 16 - Job B: M2 → M3 → M1 with times 12, 16, 16 - Job C: M2 → M3 → M1 with times 15, 20, 24 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 60
2. Job processing bound: 70
3. Lower bound: 70

Answer: 70

Question 4

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M3 → M2 with times 18, 13, 10 - Job B: M2 → M1 → M3 with times 10, 15, 15 - Job C: M1 → M3 → M2 with times 21, 16, 34 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 54
2. Job processing bound: 71
3. Lower bound: 71

Answer: 71

Question 5

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M3 → M2 with times 28, 19, 18 - Job B: M3 → M1 → M2 with times 11, 16, 35 - Job C: M1 → M2 → M3 with times 17, 27, 21 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 80
2. Job processing bound: 65
3. Lower bound: 80

Answer: 80

Question 6

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M3 → M2 with times 31, 16, 15 - Job B: M3 → M2 → M1 with times 25, 30, 19 - Job C: M1 → M2 → M3 with times 31, 24, 40 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 81
2. Job processing bound: 95
3. Lower bound: 95

Answer: 95

Question 7

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M2 → M3 with times 32, 25, 23 - Job B: M2 → M3 → M1 with times 22, 10, 16 - Job C: M1 → M2 → M3 with times 36, 37, 16 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 84
2. Job processing bound: 89
3. Lower bound: 89

Answer: 89

Question 8

A job shop has 3 machines. Jobs and their routes: - Job A: M3 → M2 → M1 with times 19, 25, 38 - Job B: M1 → M2 → M3 with times 23, 37, 36 - Job C: M3 → M2 → M1 with times 25, 15, 40 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 101
2. Job processing bound: 96
3. Lower bound: 101

Answer: 101

Question 9

A job shop has 3 machines. Jobs and their routes: - Job A: M3 → M2 → M1 with times 17, 29, 39 - Job B: M2 → M3 → M1 with times 21, 38, 35 - Job C: M3 → M1 → M2 with times 12, 36, 15 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 110
2. Job processing bound: 94
3. Lower bound: 110

Answer: 110

Question 10

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M2 → M3 with times 14, 26, 12 - Job B: M2 → M1 → M3 with times 17, 32, 15 - Job C: M2 → M1 → M3 with times 16, 35, 13 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 81
2. Job processing bound: 64
3. Lower bound: 81

Answer: 81

Question 11

A job shop has 3 machines. Jobs and their routes: - Job A: M2 → M1 → M3 with times 16, 35, 34 - Job B: M1 → M2 → M3 with times 23, 28, 29 - Job C: M3 → M1 → M2 with times 39, 20, 27 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 102
2. Job processing bound: 86
3. Lower bound: 102

Answer: 102

Question 12

A job shop has 3 machines. Jobs and their routes: - Job A: M2 → M3 → M1 with times 29, 40, 30 - Job B: M2 → M3 → M1 with times 17, 39, 33 - Job C: M2 → M1 → M3 with times 34, 28, 29 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 108
2. Job processing bound: 99
3. Lower bound: 108

Answer: 108

Question 13

A job shop has 3 machines. Jobs and their routes: - Job A: M3 → M1 → M2 with times 23, 22, 15 - Job B: M1 → M3 → M2 with times 31, 11, 37 - Job C: M1 → M3 → M2 with times 30, 40, 31 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 83
2. Job processing bound: 101
3. Lower bound: 101

Answer: 101

Question 14

A job shop has 3 machines. Jobs and their routes: - Job A: M3 → M2 → M1 with times 34, 23, 10 - Job B: M1 → M2 → M3 with times 34, 30, 37 - Job C: M2 → M1 → M3 with times 27, 39, 12 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 83
2. Job processing bound: 101
3. Lower bound: 101

Answer: 101

Question 15

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M3 → M2 with times 11, 36, 14 - Job B: M1 → M3 → M2 with times 37, 34, 12 - Job C: M3 → M1 → M2 with times 16, 13, 31 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 86
2. Job processing bound: 83
3. Lower bound: 86

Answer: 86

Question 16

A job shop has 3 machines. Jobs and their routes: - Job A: M2 → M3 → M1 with times 18, 12, 17 - Job B: M3 → M2 → M1 with times 16, 15, 18 - Job C: M1 → M3 → M2 with times 16, 32, 34 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 67
2. Job processing bound: 82
3. Lower bound: 82

Answer: 82

Question 17

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M2 → M3 with times 30, 40, 25 - Job B: M2 → M3 → M1 with times 37, 28, 33 - Job C: M3 → M1 → M2 with times 33, 13, 14 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 91
2. Job processing bound: 98
3. Lower bound: 98

Answer: 98

Question 18

A job shop has 3 machines. Jobs and their routes: - Job A: M3 → M2 → M1 with times 16, 24, 19 - Job B: M1 → M3 → M2 with times 28, 26, 10 - Job C: M1 → M2 → M3 with times 24, 28, 34 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 76
2. Job processing bound: 86
3. Lower bound: 86

Answer: 86

Question 19

A job shop has 3 machines. Jobs and their routes: - Job A: M2 → M1 → M3 with times 29, 38, 36 - Job B: M1 → M2 → M3 with times 20, 12, 15 - Job C: M1 → M3 → M2 with times 35, 18, 35 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 93
2. Job processing bound: 103
3. Lower bound: 103

Answer: 103

Question 20

A job shop has 3 machines. Jobs and their routes: - Job A: M1 → M3 → M2 with times 36, 12, 36 - Job B: M1 → M3 → M2 with times 25, 17, 32 - Job C: M3 → M2 → M1 with times 21, 19, 10 What is a lower bound on the minimum makespan?
Step-by-step solution:

1. Machine load bound: 87
2. Job processing bound: 84
3. Lower bound: 87

Answer: 87
Previous Worksheet Next Worksheet