
| Line: 1 to 1 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|
<-- Under Construction --> | ||||||||||
| Line: 86 to 86 | ||||||||||
| ||||||||||
| Changed: | ||||||||||
| < < | |*FORM FIELD ProblemDescription*|ProblemDescription|*Adapted from a real-world problem*
An airline is trying to roster captains for 6 flights. The flight schedules are:
Only one captain is required for each sector, but a captain may be a passenger on a flight (this is called paxing). In addition to the six flights above the following flights are available for paxing and operate every 2 hours:
The following rules for shifts must be observed:
| |||||||||
| > > | |*FORM FIELD ProblemDescription*|ProblemDescription|*Adapted from a real-world problem*
An airline is trying to roster captains for 6 flights. The flight schedules are:
Only one captain is required for each sector, but a captain may be a passenger on a flight (this is called paxing). In addition to the six flights above the following flights are available for paxing and operate every 2 hours:
The following rules for shifts must be observed:
| |||||||||
| ||||||||||