FICO
FICO Xpress Optimization Examples Repository
FICO Optimization Community FICO Xpress Optimization Home
Back to examples browserPrevious exampleNext example

Scheduling problems

Description
Problem name and type, featuresDifficultyRelated 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

mosel_app_2.zip[download all files]

Source Files

Data Files





b1stadium2.dat

! Data file for `b1stadium2.mos'

SUCC: [(1) [2]
       (2) [3, 4, 14]
       (3) [5]
       (4) [6, 7, 9, 10, 15]
       (5) [6]
       (6) [8, 9, 11]
       (7) [13]
       (8) [16]
       (9) [12]
      (10) [19]
      (11) [16]
      (12) [17]
      (13) [19]
      (14) [15, 16]
      (15) [19]
      (16) [19]
      (17) [18]
      (18) [19] ]
     
COST: [0 30 26 12 17 15  8  0 42 21 18  0  0 22 12  6 16  0  0]

DUR:  [2 16  9  8 10  6  2  2  9  5  3  2  1  7  4  3  9  1  0]

MAXW: [0  3  1  2  2  1  1  0  2  1  1  0  0  2  2  1  3  0  0]

BONUS: 30

Back to examples browserPrevious exampleNext example