Problem name and type, features | Difficulty | Related examples |
B‑1 | Construction of a stadium: Project scheduling (Method of Potentials) | *** | projplan_graph.mos |
| 2 problems; selection with `|', sparse/dense format, naming and redefining constraints, subroutine: procedure for solution printing, forward declaration, array of set |
B‑2 | Flow shop scheduling | **** | flowshop_graph.mos |
| alternative formulation using SOS1 |
B‑3 | Job shop scheduling | *** | jobshop_graph.mos |
| formulating disjunctions (BigM); dynamic array, range, exists, forall-do,array of set, array of list |
B‑4 | Sequencing jobs on a bottleneck machine: Single machine scheduling | *** | sequencing_graph.mos |
| 3 different objectives; subroutine: procedure for solution printing, localsetparam, if-then |
B‑5 | Paint production: Asymmetric Traveling Salesman Problem (TSP) | *** | |
| solution printing, repeat-until, cast to integer, selection with `|', round |
B‑6 | Assembly line balancing | ** | linebal_graph.mos |
| encoding of arcs, range |
Further explanation of this example:
'Applications of optimization with Xpress-MP', Chapter 7: Scheduling problems