ReasoningAbility.com

Flow Shop Scheduling Beginner-Intermediate Worksheet: Focus on common variations practice Flow Shop Scheduling BEGINNER INTERMEDIATE

Level up your Flow Shop Scheduling skills! You're at Worksheet 4 of 10 (33% through this series). This step-up challenge worksheet features 20 beginner-intermediate-level problems with a focus on common variations practice. Topics covered: flow shop scheduling for competitive exams, how to solve flow shop scheduling, flow shop scheduling tricks.

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

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

Question 1

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (47, 38) - Job B: (40, 33) - Job C: (49, 34) - Job D: (35, 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 A → Job C → Job B → Job D
3. Calculate makespan: 207

Answer: 207

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (26, 17) - Job B: (26, 18) - Job C: (37, 16) - Job D: (43, 34) - Job E: (30, 33) 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 B → Job A → Job C → Job E
3. Calculate makespan: 195

Answer: 195

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (12, 35) - Job B: (22, 11) - Job C: (47, 10) - Job D: (48, 38) - Job E: (49, 47) - Job F: (12, 32) 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 B → Job C → Job A → Job F
3. Calculate makespan: 245

Answer: 245

Question 4

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (22, 15) - Job B: (49, 43) - Job C: (42, 33) - Job D: (11, 45) - Job E: (33, 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 B → Job C → Job A → Job E → Job D
3. Calculate makespan: 202

Answer: 202

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (21, 36) - Job B: (31, 20) - Job C: (34, 27) - Job D: (42, 30) - Job E: (42, 30) - Job F: (25, 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 E → Job D → Job C → Job B → Job A → Job F
3. Calculate makespan: 240

Answer: 240

Question 6

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (10, 37) - Job B: (17, 29) - Job C: (11, 25) - Job D: (19, 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 A → Job C → Job B → Job D
3. Calculate makespan: 146

Answer: 146

Question 7

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (31, 15) - Job B: (39, 45) - Job C: (36, 16) - Job D: (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 C → Job A → Job B → Job D
3. Calculate makespan: 196

Answer: 196

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (40, 16) - Job B: (12, 22) - Job C: (25, 26) - Job D: (35, 26) 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: 139

Answer: 139

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (47, 49) - Job B: (26, 39) - Job C: (38, 32) - Job D: (49, 45) - Job E: (41, 19) - Job F: (16, 27) 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 E → Job F → Job B → Job A
3. Calculate makespan: 266

Answer: 266

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (28, 45) - Job B: (43, 32) - Job C: (39, 14) - Job D: (42, 27) 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 B → Job D → Job C → Job A
3. Calculate makespan: 197

Answer: 197

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (21, 45) - Job B: (25, 31) - Job C: (47, 18) - Job D: (43, 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 C → Job D → Job A → Job B
3. Calculate makespan: 187

Answer: 187

Question 12

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (42, 25) - Job B: (47, 10) - Job C: (23, 34) - Job D: (40, 13) - Job E: (48, 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 A → Job E → Job D → Job B → Job C
3. Calculate makespan: 234

Answer: 234

Question 13

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (38, 23) - Job B: (43, 40) - Job C: (42, 40) - Job D: (33, 18) - Job E: (48, 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 B → Job E → Job A → Job D
3. Calculate makespan: 222

Answer: 222

Question 14

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (27, 16) - Job B: (27, 41) - Job C: (37, 32) - Job D: (22, 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 A → Job D → Job B
3. Calculate makespan: 154

Answer: 154

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (29, 28) - Job B: (13, 34) - Job C: (17, 19) - Job D: (35, 25) - Job E: (10, 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 A → Job D → Job E → Job B → Job C
3. Calculate makespan: 157

Answer: 157

Question 16

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (14, 44) - Job B: (34, 39) - Job C: (13, 49) - Job D: (27, 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 D → Job C → Job A → Job B
3. Calculate makespan: 179

Answer: 179

Question 17

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (46, 13) - Job B: (24, 11) - Job C: (10, 39) - Job D: (21, 25) - Job E: (29, 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 A → Job B → Job C → Job D → Job E
3. Calculate makespan: 186

Answer: 186

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (34, 39) - Job B: (42, 17) - Job C: (32, 46) - Job D: (19, 48) 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 B → Job D → Job C → Job A
3. Calculate makespan: 194

Answer: 194

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (47, 26) - Job B: (16, 47) - Job C: (29, 39) - Job D: (46, 49) 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: 208

Answer: 208

Question 20

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (21, 32) - Job B: (14, 27) - Job C: (42, 23) - Job D: (16, 43) - Job E: (33, 31) - Job F: (15, 27) 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 F → Job D → Job A
3. Calculate makespan: 227

Answer: 227
Previous Worksheet Next Worksheet