Problem name and type, features | Difficulty | Related examples |
I‑1 | Assigning personnel to machines: Assignment problem | **** | assignment_graph.mos, c6assign.mos |
| formulation of maximin objective; heuristic solution + 2 different problems (incremental definition) solved, working with sets, while-do, forall-do |
I‑2 | Scheduling nurses | *** | |
| 2 problems, using mod to formulate cyclic schedules; forall-do, set of integer, getact |
I‑3 | Establishing a college timetable | *** | timetable_graph.mos |
| many specific constraints, tricky (pseudo) objective function |
I‑4 | Exam schedule | ** | |
| symmetry breaking, no objective |
I‑5 | Production planning with personnel assignment | *** | |
| 2 problems, defined incrementally with partial re-definition of constraints (named constraints), exists, create, dynamic array |
I‑6 | Planning the personnel at a construction site | ** | persplan_graph.mos |
| formulation of balance constraints using inline if |
Further explanation of this example:
'Applications of optimization with Xpress-MP', Chapter 14: Timetabling and personnel planning