ReasoningAbility.com

Flow Shop Scheduling: Worksheet 6 - Intermediate-Advanced Practice Flow Shop Scheduling INTERMEDIATE ADVANCED

Ready to master Flow Shop Scheduling? This timed practice ⚡ worksheet (6/10) presents 20 intermediate-advanced-level challenges. Focus area: speed building. Learn to solve flow shop scheduling tricks, handle flow shop scheduling shortcut methods, and perfect flow shop scheduling bank exam questions with our step-by-step solutions.

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

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

Question 1

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

Answer: 158

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (22, 27) - Job B: (46, 11) - Job C: (44, 20) - Job D: (12, 40) 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: 169

Answer: 169

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (32, 24) - Job B: (25, 16) - Job C: (45, 25) - Job D: (21, 50) - Job E: (44, 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 E → Job B → Job D
3. Calculate makespan: 217

Answer: 217

Question 4

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

Answer: 202

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (35, 13) - Job B: (23, 13) - Job C: (11, 39) - Job D: (20, 18) - Job E: (27, 17) - Job F: (41, 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 B → Job A → Job C
3. Calculate makespan: 198

Answer: 198

Question 6

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (26, 30) - Job B: (23, 32) - Job C: (17, 38) - Job D: (33, 26) - Job E: (45, 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 E → Job D → Job C → Job B → Job A
3. Calculate makespan: 204

Answer: 204

Question 7

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (40, 26) - Job B: (14, 22) - Job C: (50, 44) - Job D: (13, 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 C → Job A → Job D → Job B
3. Calculate makespan: 184

Answer: 184

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 32) - Job B: (29, 50) - Job C: (25, 39) - Job D: (14, 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 D → Job C → Job B
3. Calculate makespan: 179

Answer: 179

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (50, 11) - Job B: (32, 24) - Job C: (17, 26) - Job D: (39, 19) 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 A → Job C
3. Calculate makespan: 164

Answer: 164

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (16, 50) - Job B: (14, 40) - Job C: (50, 13) - Job D: (15, 40) - Job E: (29, 11) - Job F: (19, 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 C → Job E → Job B → Job D → Job A → Job F
3. Calculate makespan: 256

Answer: 256

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (32, 29) - Job B: (16, 16) - Job C: (17, 22) - Job D: (44, 19) - Job E: (25, 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 D → Job B → Job C → Job E
3. Calculate makespan: 163

Answer: 163

Question 12

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

Answer: 155

Question 13

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (22, 24) - Job B: (24, 47) - Job C: (44, 11) - Job D: (46, 28) - Job E: (11, 30) - Job F: (17, 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 D → Job C → Job E → Job F → Job A → Job B
3. Calculate makespan: 240

Answer: 240

Question 14

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (21, 30) - Job B: (46, 26) - Job C: (27, 32) - Job D: (38, 46) - Job E: (11, 33) - Job F: (41, 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 F → Job E → Job A → Job C → Job D
3. Calculate makespan: 239

Answer: 239

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 36) - Job B: (40, 25) - Job C: (43, 35) - Job D: (32, 25) - Job E: (47, 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 A → Job C → Job E → Job D → Job B
3. Calculate makespan: 236

Answer: 236

Question 16

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 38) - Job B: (14, 20) - Job C: (24, 46) - Job D: (20, 25) - Job E: (27, 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 B → Job D → Job C → Job E
3. Calculate makespan: 225

Answer: 225

Question 17

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (24, 12) - Job B: (25, 41) - Job C: (17, 45) - Job D: (10, 47) - Job E: (23, 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 D → Job C → Job E → Job B
3. Calculate makespan: 205

Answer: 205

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (46, 41) - Job B: (46, 32) - Job C: (23, 23) - Job D: (30, 11) - Job E: (44, 33) - Job F: (34, 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 E → Job B → Job D → Job C → Job F
3. Calculate makespan: 259

Answer: 259

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (39, 22) - Job B: (46, 42) - Job C: (32, 23) - Job D: (18, 23) - Job E: (45, 36) - Job F: (20, 40) 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 E → Job C → Job A → Job D → Job F
3. Calculate makespan: 247

Answer: 247

Question 20

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (39, 13) - Job B: (30, 27) - Job C: (39, 11) - Job D: (46, 33) - Job E: (42, 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 B → Job E → Job A → Job C
3. Calculate makespan: 207

Answer: 207
Previous Worksheet Next Worksheet