ReasoningAbility.com

Flow Shop Scheduling Advanced Worksheet: Focus on exam-oriented approach Flow Shop Scheduling ADVANCED

Level up your Flow Shop Scheduling skills! You're at Worksheet 8 of 10 (77% through this series). This exam hall simulation worksheet features 20 advanced-level problems with a focus on exam-oriented approach. Topics covered: flow shop scheduling bank exam questions, flow shop scheduling ssc cgl, flow shop scheduling reasoning tricks.

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

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

Question 1

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (13, 32) - Job B: (12, 46) - Job C: (43, 50) - Job D: (44, 26) - Job E: (15, 45) - Job F: (16, 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 A → Job E → Job F → Job C
3. Calculate makespan: 267

Answer: 267

Question 2

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

Answer: 191

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (36, 20) - Job B: (10, 16) - Job C: (38, 15) - Job D: (30, 24) - Job E: (46, 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 E → Job D → Job A → Job C → Job B
3. Calculate makespan: 181

Answer: 181

Question 4

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (20, 21) - Job B: (42, 34) - Job C: (44, 44) - Job D: (11, 21) - Job E: (11, 22) 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 E → Job A → Job C
3. Calculate makespan: 184

Answer: 184

Question 5

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

Answer: 102

Question 6

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

Answer: 172

Question 7

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (39, 17) - Job B: (23, 26) - Job C: (21, 25) - Job D: (33, 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 A → Job C → Job B → Job D
3. Calculate makespan: 158

Answer: 158

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (18, 35) - Job B: (40, 14) - Job C: (31, 15) - Job D: (11, 26) - Job E: (19, 31) 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 → Job E
3. Calculate makespan: 177

Answer: 177

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (48, 33) - Job B: (21, 13) - Job C: (25, 31) - Job D: (48, 16) 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
3. Calculate makespan: 173

Answer: 173

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (30, 25) - Job B: (28, 49) - Job C: (14, 50) - Job D: (32, 13) - Job E: (26, 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 D → Job C → Job E → Job B
3. Calculate makespan: 208

Answer: 208

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (20, 14) - Job B: (16, 27) - Job C: (42, 48) - Job D: (31, 28) - Job E: (45, 14) - Job F: (50, 31) 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 E → Job A → Job B → Job C
3. Calculate makespan: 252

Answer: 252

Question 12

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

Answer: 152

Question 13

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

Answer: 181

Question 14

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 32) - Job B: (46, 43) - Job C: (42, 16) - Job D: (42, 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 A → Job C → Job D
3. Calculate makespan: 227

Answer: 227

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (21, 12) - Job B: (47, 39) - Job C: (48, 35) - Job D: (22, 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 B → Job C → Job D → Job A
3. Calculate makespan: 162

Answer: 162

Question 16

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (14, 14) - Job B: (10, 39) - Job C: (30, 45) - Job D: (25, 13) 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
3. Calculate makespan: 136

Answer: 136

Question 17

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

Answer: 250

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (16, 38) - Job B: (17, 43) - Job C: (11, 16) - Job D: (13, 36) - Job E: (13, 45) - Job F: (39, 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 F → Job C → Job D → Job E → Job A → Job B
3. Calculate makespan: 254

Answer: 254

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (29, 25) - Job B: (30, 27) - Job C: (26, 12) - Job D: (46, 22) - Job E: (19, 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 B → Job A → Job D → Job E → Job C
3. Calculate makespan: 162

Answer: 162

Question 20

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (28, 35) - Job B: (49, 20) - Job C: (45, 30) - Job D: (29, 33) - Job E: (16, 39) - Job F: (10, 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 B → Job F → Job E → Job A → Job D
3. Calculate makespan: 266

Answer: 266
Previous Worksheet Next Worksheet