| |||||||||
Hybrid MIP-CP problem solving: concurrent solving Description The problem of scheduling a given set of jobs on a set of
machines where durations and cost depend on the choice of
the resource may be broken down into several subproblems,
machine assignment and single-machine sequencing.
The main problem (machine assignment)
is solved as a MIP problem and the sequencing
subproblems solved at the nodes of the branch-and-bound
search generate new constraints that are added to the
main problem using the cut manager functionality of
Xpress Optimizer. Several implementations of this
decomposition approach are available, either using a
hybrid MIP-CP formulation or a second MIP model for
solving the subproblems. The solving of the subproblems
may be executed sequentially or in parallel.
Source Files By clicking on a file name, a preview is opened at the bottom of this page. Data Files sched_4_20.dat ! Data file for `sched_*.mos' NP: [20] NM: [4] ! 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 REL: [ 2 4 5 7 9 0 3 6 11 2 3 4 5 8 1 3 5 6 6 10] DUE: [32 33 36 37 39 34 30 26 36 38 31 22 29 28 25 35 35 40 35 28] COST: [12 6 7 10 13 6 10 11 10 4 6 8 8 4 5 6 12 6 7 12 10 5 6 8 7 4 5 6 9 5 5 7 10 5 7 8 8 4 5 6 15 8 9 12 13 7 7 10 11 5 7 8 8 3 5 6 13 6 10 11 12 6 9 11 9 5 5 6 8 4 5 6 14 8 11 12 10 5 6 8 ] DUR: [10 14 13 11 7 9 8 7 11 17 15 13 6 9 12 9 4 6 10 8 2 3 4 4 10 15 16 12 8 11 12 10 10 14 13 10 8 11 14 12 9 12 16 12 3 5 6 5 7 11 14 13 3 4 8 7 7 6 12 10 2 3 8 6 10 15 16 12 5 8 7 7 4 6 10 7 2 3 4 4 ] | |||||||||
© Copyright 2023 Fair Isaac Corporation. |