ReasoningAbility.com

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

This expert challenge 📈 worksheet focuses on Flow 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 flow shop scheduling, flow shop scheduling tricks, and flow 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 Flow Shop Scheduling
Worksheet 5 of 10 (44% complete)

Question 1

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (44, 39) - Job B: (12, 20) - Job C: (41, 32) - Job D: (38, 29) - Job E: (28, 38) 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 D → Job B → Job E
3. Calculate makespan: 210

Answer: 210

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (15, 38) - Job B: (43, 10) - Job C: (50, 27) - Job D: (44, 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 D → Job B → Job A
3. Calculate makespan: 190

Answer: 190

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (48, 40) - Job B: (33, 23) - Job C: (28, 24) - Job D: (49, 10) - Job E: (41, 14) - Job F: (20, 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 A → Job C → Job B → Job E → Job D → Job F
3. Calculate makespan: 267

Answer: 267

Question 4

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (33, 14) - Job B: (28, 13) - Job C: (35, 39) - Job D: (21, 12) - Job E: (16, 43) - Job F: (48, 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 F → Job A → Job B → Job D → Job E → Job C
3. Calculate makespan: 228

Answer: 228

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (50, 15) - Job B: (31, 33) - Job C: (32, 48) - Job D: (25, 27) - Job E: (30, 43) - Job F: (37, 43) 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 → Job F
3. Calculate makespan: 272

Answer: 272

Question 6

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (14, 30) - Job B: (48, 47) - Job C: (12, 39) - Job D: (45, 36) - Job E: (16, 45) - Job F: (12, 44) 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 F → Job A → Job E
3. Calculate makespan: 289

Answer: 289

Question 7

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

Answer: 159

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (27, 12) - Job B: (13, 10) - Job C: (34, 31) - Job D: (38, 46) 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: 158

Answer: 158

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (38, 26) - Job B: (25, 47) - Job C: (26, 22) - Job D: (15, 12) 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 D → Job B
3. Calculate makespan: 151

Answer: 151

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (40, 14) - Job B: (36, 14) - Job C: (17, 50) - Job D: (35, 36) - Job E: (18, 45) - Job F: (28, 21) 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 F → Job B → Job A → Job C → Job E → Job D
3. Calculate makespan: 252

Answer: 252

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (47, 45) - Job B: (33, 16) - Job C: (17, 40) - Job D: (27, 34) - Job E: (27, 46) - Job F: (44, 37) 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 F → Job B → Job C → Job D → Job E
3. Calculate makespan: 265

Answer: 265

Question 12

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (38, 11) - Job B: (44, 36) - Job C: (35, 45) - Job D: (13, 35) - Job E: (13, 28) 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 A → Job D → Job E → Job C
3. Calculate makespan: 203

Answer: 203

Question 13

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (38, 31) - Job B: (30, 28) - Job C: (16, 26) - Job D: (21, 21) - Job E: (34, 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 A → Job B → Job E → Job C → Job D
3. Calculate makespan: 166

Answer: 166

Question 14

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (16, 42) - Job B: (15, 30) - Job C: (12, 28) - Job D: (23, 44) 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 A → Job D
3. Calculate makespan: 156

Answer: 156

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 41) - Job B: (32, 44) - Job C: (20, 33) - Job D: (29, 17) - Job E: (23, 41) - Job F: (45, 42) 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 F → Job D → Job C → Job E → Job B → Job A
3. Calculate makespan: 263

Answer: 263

Question 16

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

Answer: 221

Question 17

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (11, 44) - Job B: (12, 45) - Job C: (22, 27) - Job D: (39, 50) - Job E: (24, 15) - Job F: (33, 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 A → Job B → Job C → Job F → Job D
3. Calculate makespan: 239

Answer: 239

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 18) - Job B: (18, 36) - Job C: (36, 11) - Job D: (25, 39) - Job E: (29, 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 A → Job E → Job C → Job B → Job D
3. Calculate makespan: 207

Answer: 207

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (26, 41) - Job B: (28, 11) - Job C: (11, 47) - Job D: (49, 12) - Job E: (27, 28) - Job F: (22, 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 F → Job D → Job B → Job C → Job A → Job E
3. Calculate makespan: 226

Answer: 226

Question 20

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (24, 35) - Job B: (44, 47) - Job C: (17, 33) - Job D: (13, 37) - Job E: (26, 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 C → Job A → Job E → Job B
3. Calculate makespan: 210

Answer: 210
Previous Worksheet Next Worksheet