ReasoningAbility.com

Flow Shop Scheduling: Worksheet 10 - Expert Practice Flow Shop Scheduling EXPERT

Ready to master Flow Shop Scheduling? This accuracy focus 👑 worksheet (10/10) presents 20 expert-level challenges. Focus area: application-based learning. Learn to solve flow shop scheduling reasoning tricks, handle fast flow shop scheduling solving, and perfect flow shop scheduling mastery with our step-by-step solutions.

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

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

Question 1

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (27, 37) - Job B: (39, 13) - Job C: (49, 21) - Job D: (16, 34) - Job E: (42, 41) - Job F: (41, 45) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job E → Job C → Job B → Job D → Job A → Job F
3. Calculate makespan: 262

Answer: 262

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 44) - Job B: (38, 12) - Job C: (39, 31) - Job D: (38, 47) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job A → Job C → Job B → Job D
3. Calculate makespan: 211

Answer: 211

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (34, 36) - Job B: (37, 14) - Job C: (40, 21) - Job D: (31, 35) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job B → Job D → Job A
3. Calculate makespan: 179

Answer: 179

Question 4

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (22, 23) - Job B: (27, 45) - Job C: (48, 10) - Job D: (41, 34) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job C → Job A → Job B
3. Calculate makespan: 183

Answer: 183

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (45, 31) - Job B: (43, 22) - Job C: (30, 18) - Job D: (17, 29) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job A → Job B → Job C → Job D
3. Calculate makespan: 165

Answer: 165

Question 6

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (14, 10) - Job B: (10, 16) - Job C: (48, 16) - Job D: (37, 23) - Job E: (11, 24) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job C → Job A → Job B → Job E
3. Calculate makespan: 151

Answer: 151

Question 7

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (42, 42) - Job B: (20, 48) - Job C: (22, 18) - Job D: (32, 41) - Job E: (31, 42) - Job F: (24, 35) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job B → Job F → Job E → Job D → Job A
3. Calculate makespan: 250

Answer: 250

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (32, 30) - Job B: (15, 47) - Job C: (30, 34) - Job D: (40, 34) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job A → Job B → Job C
3. Calculate makespan: 185

Answer: 185

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 45) - Job B: (42, 17) - Job C: (49, 36) - Job D: (45, 24) - Job E: (21, 36) - Job F: (27, 29) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job D → Job B → Job E → Job F → Job A
3. Calculate makespan: 270

Answer: 270

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (12, 46) - Job B: (23, 36) - Job C: (26, 43) - Job D: (50, 24) - Job E: (30, 22) - Job F: (45, 14) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job E → Job F → Job A → Job B → Job C
3. Calculate makespan: 264

Answer: 264

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (50, 15) - Job B: (11, 15) - Job C: (43, 48) - Job D: (44, 36) - Job E: (39, 10) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job A → Job E → Job B → Job C
3. Calculate makespan: 235

Answer: 235

Question 12

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (10, 40) - Job B: (17, 27) - Job C: (23, 44) - Job D: (25, 24) - Job E: (49, 41) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job E → Job D → Job A → Job B → Job C
3. Calculate makespan: 225

Answer: 225

Question 13

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (30, 11) - Job B: (28, 46) - Job C: (23, 49) - Job D: (30, 15) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job A → Job C → Job B
3. Calculate makespan: 178

Answer: 178

Question 14

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (45, 24) - Job B: (44, 17) - Job C: (49, 33) - Job D: (25, 36) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job A → Job B → Job D
3. Calculate makespan: 199

Answer: 199

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 11) - Job B: (10, 20) - Job C: (39, 25) - Job D: (10, 34) - Job E: (18, 11) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job E → Job A → Job B → Job D
3. Calculate makespan: 163

Answer: 163

Question 16

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 21) - Job B: (38, 16) - Job C: (12, 10) - Job D: (44, 33) - Job E: (34, 45) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job D → Job A → Job B → Job C → Job E
3. Calculate makespan: 214

Answer: 214

Question 17

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (10, 46) - Job B: (23, 23) - Job C: (48, 10) - Job D: (16, 29) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job A → Job D → Job B
3. Calculate makespan: 156

Answer: 156

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (14, 26) - Job B: (23, 49) - Job C: (44, 42) - Job D: (21, 47) - Job E: (48, 21) - Job F: (15, 17) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job E → Job A → Job F → Job D → Job B
3. Calculate makespan: 252

Answer: 252

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (27, 21) - Job B: (25, 30) - Job C: (43, 35) - Job D: (40, 13) - Job E: (25, 32) - Job F: (42, 20) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job A → Job F → Job D → Job B → Job E
3. Calculate makespan: 239

Answer: 239

Question 20

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (30, 50) - Job B: (10, 34) - Job C: (14, 12) - Job D: (37, 45) - Job E: (30, 11) Using Johnson's Rule, what is the minimum makespan?
Step-by-step solution (Johnson's Rule):

1. Apply Johnson's Rule:
- If M1 time < M2 time, schedule early
- If M2 time < M1 time, schedule late
2. Optimal sequence: Job C → Job E → Job B → Job A → Job D
3. Calculate makespan: 184

Answer: 184
Previous Worksheet