ReasoningAbility.com

Master Flow Shop Scheduling - Intermediate-Advanced Level Problems Flow Shop Scheduling INTERMEDIATE ADVANCED

Excel in competitive exams with this self assessment worksheet on Flow Shop Scheduling. Worksheet 7 of 10 contains 20 intermediate-advanced-level problems. Target your accuracy improvement skills while practicing flow shop scheduling shortcut methods, flow shop scheduling bank exam questions, and flow shop scheduling ssc cgl.

📝 Worksheet 7 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 7 of 10 (66% complete)

Question 1

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 27) - Job B: (18, 34) - Job C: (18, 36) - Job D: (40, 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 A → Job B → Job C → Job D
3. Calculate makespan: 178

Answer: 178

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (41, 13) - Job B: (14, 50) - Job C: (35, 17) - Job D: (35, 46) - Job E: (34, 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 C → Job E → Job A → Job B → Job D
3. Calculate makespan: 220

Answer: 220

Question 3

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

Answer: 190

Question 4

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (34, 50) - Job B: (32, 44) - Job C: (36, 47) - Job D: (28, 18) - Job E: (17, 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 E → Job B → Job A → Job C
3. Calculate makespan: 220

Answer: 220

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (17, 21) - Job B: (33, 23) - Job C: (19, 34) - Job D: (23, 50) - Job E: (10, 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 B → Job E → Job A → Job C → Job D
3. Calculate makespan: 207

Answer: 207

Question 6

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (31, 47) - Job B: (23, 17) - Job C: (15, 28) - Job D: (21, 35) - Job E: (50, 47) - Job F: (49, 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 F → Job B → Job C → Job D → Job A
3. Calculate makespan: 253

Answer: 253

Question 7

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

Answer: 223

Question 8

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

Answer: 228

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (27, 14) - Job B: (35, 44) - Job C: (14, 35) - Job D: (41, 45) - Job E: (37, 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 C → Job B → Job E → Job D
3. Calculate makespan: 211

Answer: 211

Question 10

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

Answer: 161

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (12, 20) - Job B: (36, 33) - Job C: (44, 13) - Job D: (38, 40) - Job E: (21, 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 B → Job E → Job C → Job A → Job D
3. Calculate makespan: 191

Answer: 191

Question 12

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (47, 14) - Job B: (18, 34) - Job C: (15, 49) - Job D: (28, 37) - Job E: (26, 50) - Job F: (17, 39) 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 F → Job B → Job E → Job D
3. Calculate makespan: 271

Answer: 271

Question 13

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (16, 44) - Job B: (33, 13) - Job C: (27, 33) - Job D: (11, 25) - Job E: (13, 15) - Job F: (27, 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 B → Job D → Job E → Job A → Job C → Job F
3. Calculate makespan: 208

Answer: 208

Question 14

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

Answer: 205

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (50, 50) - Job B: (15, 46) - Job C: (12, 45) - Job D: (35, 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 C → Job B → Job D → Job A
3. Calculate makespan: 194

Answer: 194

Question 16

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

Answer: 157

Question 17

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

Answer: 229

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (44, 23) - Job B: (25, 37) - Job C: (15, 11) - Job D: (38, 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 D → Job A → Job C → Job B
3. Calculate makespan: 159

Answer: 159

Question 19

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

Answer: 192

Question 20

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

Answer: 179
Previous Worksheet Next Worksheet