
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
<-- Under Construction --> | ||||||||
| Line: 26 to 26 | ||||||||
Operations Research Topics: IntegerProgrammingApplication Areas: RosteringContents | ||||||||
| Changed: | ||||||||
| < < | ||||||||
| > > | ||||||||
Problem DescriptionAdapted 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:
| ||||||||
| Line: 36 to 34 | ||||||||
Return to top
Problem Formulation | ||||||||
| Changed: | ||||||||
| < < | The formulation... | |||||||
| > > | The formulation... | |||||||
Return to top
Computational Model | ||||||||
| Changed: | ||||||||
| < < | The computational model... | |||||||
| > > | The computational model... | |||||||
Return to top
Results | ||||||||
| Changed: | ||||||||
| < < | The results... | |||||||
| > > | The results... | |||||||
Return to top
Conclusions | ||||||||
| Changed: | ||||||||
| < < | In conclusion... | |||||||
| > > | In conclusion... | |||||||
| Return to top | ||||||||
| Changed: | ||||||||
| < < | ||||||||
| > > | <-- --> | |||||||
| Changed: | ||||||||
| < < | ||||||||
| > > | <-- | |||||||