Assigned:
Thursday, April 27, 2017
General Instructions
Numbered problems are all from the textbook Scheduling:
Theory, Algorithms and Systems.
You do not need to hand this hw in
Problems
- Problem 9.4
- Problem 9.5
- Problem 9.7
- For the private jet application discussed in class, we had two basic classes of constraints:
- Each unscheduled trip will either be served by one aircraft, or will be subcontracted
- The set of trips chosen are consistent, that is, the set of variables zijk that
are set to 1 describe a feasible set of trips for each aircraft.
Give an integer programming formulation that captures these constraints, using the variables described in class. You may need multiple sets of inequalities to capture each constraint.
- Consider the tanker problem considered in class, and suppose that the charter costs for the cargo are not the ones given,
but rather
| Cargo | Cost |
| 1 | 1889 |
| 2 | 1600 |
| 3 | 1009 |
| 4 | 889 |
| 5 | 1045 |
| 6 | 1991 |
| 7 | 1403 |
| 8 | 1334 |
| 9 | 2201 |
| 10 | 1789 |
| 11 | 1212 |
| 12 | 1001 |
All the other data is the same as before. Solve this instance. You will almost surely need to use some kind of solver. Please
explain your formulation and data and show any input/output to a solver.
Switch to:
[email protected]