Loading...
Select for X and for Y two streets such that every cleaning of the street chosen for X must be followed on the next day by a cleaning of the street chosen for Y, consistent with the given information. Make only two selections, one in each column.
X
Y
First Street
Second Street
Third Street
Central Street
Grand Street
Main Street
| Street | Cleaning Day | Frequency |
| First Street | Thursday | Every week (weekly) |
| Second Street | Tuesday | Every 4th week |
| Third Street | Monday | Every week (weekly) |
| Central Street | Wednesday | Every 3rd week |
| Grand Street | Saturday | Every 4th week |
| Main Street | Friday | Every 2nd week |
Key Pattern: For "every cleaning of X to be followed by cleaning of Y":
Possible day transitions:
Central Street (every 3rd Wednesday) \(\rightarrow\) First Street (every Thursday)
First Street (every Thursday) \(\rightarrow\) Main Street (every 2nd Friday)
The solution leverages frequency compatibility: a weekly cleaning (First Street) encompasses all instances of a less frequent cleaning (Central Street), ensuring the "every" condition is satisfied.
When solving TPA scheduling problems: