ReasoningAbility.com

Shift Rotation Schedule - Intermediate Level: tricky scenarios handling Shift Rotation Schedule INTERMEDIATE

This expert challenge 📈 worksheet focuses on Shift Rotation Schedule - a key topic in Scheduling. You'll solve 20 intermediate-level problems (Worksheet 5 of 10). The primary focus is on tricky scenarios handling. Master how to solve shift rotation schedule, shift rotation schedule tricks, and shift rotation schedule shortcut methods through systematic practice.

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

What you'll learn in this worksheet:
Your progress through Shift Rotation Schedule
Worksheet 5 of 10 (44% complete)

Question 1

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 2

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 3

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 4

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 5

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 6

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 7

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 8

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 9

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 10

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 11

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 12

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 13

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 14

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 15

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 16

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 17

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 18

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 19

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.

Question 20

Four employees need to be scheduled for three shifts over three days. The constraints are: - Each employee works exactly one shift per day - No employee works the same shift two days in a row - Alice works Morning shift on Monday - Bob cannot work Night shift - Charlie works Evening shift on Tuesday Who works the Evening shift on Wednesday?
Step-by-step solution:

Table Method with Constraint Elimination:
1. Create a 3D table: Days x Shifts x Employees

2. Apply direct constraints:
- Monday Morning: Alice (fixed)
- Tuesday Evening: Charlie (fixed)
- Bob: Never Night shift (all days)

3. Apply rotation constraint:
- Alice (Morning Mon) cannot be Morning Tue
- Charlie (Evening Tue) cannot be Evening Wed

4. Fill Monday:
- Morning: Alice
- Evening: Charlie (can work evening)
- Night: Diana (Bob can't do night)

5. Fill Tuesday:
- Morning: Bob (Alice can't repeat, Charlie is evening)
- Evening: Charlie (fixed)
- Night: Diana (Bob can't)

6. Fill Wednesday:
- Charlie can't be Evening (was Evening Tue)
- Alice can be Evening (was Morning Mon, okay to shift)
- Answer: Alice works Evening on Wednesday

Key Strategy: Apply fixed constraints first, then use rotation rules to eliminate impossible assignments systematically.
Previous Worksheet Next Worksheet