ReasoningAbility.com

Master Flow Shop Scheduling - Beginner Level Problems Flow Shop Scheduling BEGINNER

Excel in competitive exams with this skill builder ⚡ worksheet on Flow Shop Scheduling. Worksheet 3 of 10 contains 20 beginner-level problems. Target your step-by-step problem solving skills while practicing flow shop scheduling practice, flow shop scheduling for competitive exams, and how to solve flow shop scheduling.

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

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

Question 1

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

Answer: 186

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 30) - Job B: (10, 18) - Job C: (50, 50) - Job D: (24, 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 A → Job B → Job D → Job C
3. Calculate makespan: 183

Answer: 183

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (36, 32) - Job B: (29, 29) - Job C: (42, 11) - Job D: (38, 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 C → Job B → Job D
3. Calculate makespan: 188

Answer: 188

Question 4

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (40, 14) - Job B: (13, 46) - Job C: (32, 19) - Job D: (14, 14) - Job E: (40, 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 C → Job A → Job B → Job D → Job E
3. Calculate makespan: 195

Answer: 195

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (14, 46) - Job B: (10, 34) - Job C: (33, 12) - Job D: (26, 26) - Job E: (12, 50) 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: 201

Answer: 201

Question 6

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

Answer: 219

Question 7

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

Answer: 191

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (34, 23) - Job B: (10, 50) - Job C: (44, 25) - Job D: (29, 31) - Job E: (30, 50) 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 → Job E
3. Calculate makespan: 232

Answer: 232

Question 9

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

Answer: 175

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (16, 37) - Job B: (32, 26) - Job C: (22, 24) - Job D: (10, 26) - Job E: (22, 24) - Job F: (20, 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 F → Job D → Job A → Job C → Job E
3. Calculate makespan: 188

Answer: 188

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (48, 21) - Job B: (31, 17) - Job C: (40, 42) - Job D: (31, 44) - Job E: (21, 44) - Job F: (33, 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 B → Job E → Job D → Job F → Job C
3. Calculate makespan: 266

Answer: 266

Question 12

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

Answer: 145

Question 13

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

Answer: 270

Question 14

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

Answer: 196

Question 15

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

Answer: 135

Question 16

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

Answer: 170

Question 17

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

Answer: 194

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (43, 46) - Job B: (32, 10) - Job C: (49, 36) - Job D: (50, 34) - Job E: (19, 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 D → Job B → Job E → Job A
3. Calculate makespan: 242

Answer: 242

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (21, 18) - Job B: (29, 50) - Job C: (40, 38) - Job D: (18, 20) - Job E: (25, 14) - 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 C → Job A → Job F → Job E → Job D → Job B
3. Calculate makespan: 231

Answer: 231

Question 20

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

Answer: 217
Previous Worksheet Next Worksheet