ReasoningAbility.com

Flow Shop Scheduling: Worksheet 2 - Beginner Practice Flow Shop Scheduling BEGINNER

Ready to master Flow Shop Scheduling? This entry level practice worksheet (2/10) presents 20 beginner-level challenges. Focus area: pattern recognition. Learn to solve flow shop scheduling reasoning questions, handle flow shop scheduling practice, and perfect flow shop scheduling for competitive exams with our step-by-step solutions.

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

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

Question 1

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (45, 37) - Job B: (32, 42) - Job C: (13, 24) - Job D: (17, 40) - Job E: (16, 19) - Job F: (26, 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 E → Job D → Job F → Job B
3. Calculate makespan: 250

Answer: 250

Question 2

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (36, 20) - Job B: (38, 10) - Job C: (38, 35) - Job D: (14, 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 C → Job A → Job B → Job D
3. Calculate makespan: 144

Answer: 144

Question 3

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (22, 41) - Job B: (10, 47) - Job C: (25, 11) - Job D: (20, 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 D → Job A
3. Calculate makespan: 154

Answer: 154

Question 4

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

Answer: 182

Question 5

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (11, 50) - Job B: (26, 48) - Job C: (17, 27) - Job D: (15, 30) - Job E: (22, 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 A → Job D → Job C → Job E → Job B
3. Calculate makespan: 216

Answer: 216

Question 6

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (24, 26) - Job B: (38, 22) - Job C: (20, 46) - Job D: (39, 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 B → Job C → Job A → Job D
3. Calculate makespan: 175

Answer: 175

Question 7

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

Answer: 162

Question 8

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (36, 22) - Job B: (18, 32) - Job C: (37, 46) - Job D: (31, 19) - Job E: (37, 27) - Job F: (45, 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 E → Job A → Job D → Job F → Job B → Job C
3. Calculate makespan: 250

Answer: 250

Question 9

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (23, 15) - Job B: (29, 40) - Job C: (41, 11) - Job D: (24, 18) - Job E: (11, 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 D → Job A → Job C → Job E → Job B
3. Calculate makespan: 175

Answer: 175

Question 10

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (49, 48) - Job B: (20, 36) - Job C: (22, 21) - Job D: (32, 10) - Job E: (50, 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 E → Job C → Job D → Job B
3. Calculate makespan: 209

Answer: 209

Question 11

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (11, 21) - Job B: (41, 22) - Job C: (45, 23) - Job D: (42, 27) - Job E: (22, 19) - Job F: (42, 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 D → Job C → Job B → Job E → Job A
3. Calculate makespan: 232

Answer: 232

Question 12

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

Answer: 177

Question 13

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

Answer: 247

Question 14

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

Answer: 165

Question 15

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (35, 24) - Job B: (40, 22) - Job C: (11, 36) - Job D: (34, 21) - Job E: (33, 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 B → Job D → Job C → Job E
3. Calculate makespan: 205

Answer: 205

Question 16

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (42, 31) - Job B: (47, 16) - Job C: (28, 11) - Job D: (25, 42) - Job E: (26, 30) - Job F: (31, 25) 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: 245

Answer: 245

Question 17

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

Answer: 222

Question 18

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (19, 49) - Job B: (16, 34) - Job C: (44, 47) - Job D: (35, 45) - Job E: (30, 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 E → Job B → Job A → Job D → Job C
3. Calculate makespan: 225

Answer: 225

Question 19

A flow shop has 2 machines (M1 → M2). Jobs and processing times (M1, M2): - Job A: (12, 50) - Job B: (22, 48) - Job C: (37, 28) - Job D: (32, 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 C → Job A → Job B → Job D
3. Calculate makespan: 201

Answer: 201

Question 20

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

Answer: 161
Previous Worksheet Next Worksheet