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

Resource-constrained project scheduling problem

Description
Formulating and solving resource-constrained project scheduling problems via scheduling objects of the Kalis solver
  • Resource-constrained project scheduling problem (RCPSP): rcpsp.mos. Tasks have fixed durations and require specific amounts of several resources with discrete capacity.
  • Multi-mode resource constrained project scheduling problem (MRCPSP): mrcpsp.mos. Task durations and amounts of resource use (or consumption) by tasks depend on the selected task mode. Some resources are renewable, others are non-renewable.

mrcpsp.zip[download all files]

Source Files
By clicking on a file name, a preview is opened at the bottom of this page.
rcpsp.mos[download]
mrcpsp.mos[download]

Data Files
j102_2.dat[download]
j102_4.dat[download]
j102_5.dat[download]
j102_6.dat[download]
j102_7.dat[download]
j102_9.dat[download]
j102_10.dat[download]
j301_1.dat[download]
j301_2.dat[download]
j301_3.dat[download]
j301_4.dat[download]
j301_5.dat[download]
j301_6.dat[download]
j301_7.dat[download]
j301_8.dat[download]
j301_9.dat[download]
j301_10.dat[download]




j102_4.dat

TASKS: [1 2 3 4 5 6 7 8 9 10 11 12]
RESOURCES: [1 2 3 4]
REN: [(1) true (2) true (3) false (4) false]
HORIZON: 74
SUCC: [(1) [2 3 4] (2) [6 10] (3) [7 10 11] (4) [5 9] (5) [8] (6) [7 11] (7) [9] (8) [11] (9) [12] (10) [12] (11) [12] (12) [] ]
CAPA: [(1) 9 (2) 8 (3) 35 (4) 31]
DUR: [(1 0) 0
      (2 0) 2 (2 1) 6 (2 2) 8
      (3 0) 2 (3 1) 3 (3 2) 7
      (4 0) 5 (4 1) 9 (4 2) 10
      (5 0) 4 (5 1) 4 (5 2) 6
      (6 0) 2 (6 1) 3 (6 2) 5
      (7 0) 1 (7 1) 4 (7 2) 9
      (8 0) 2 (8 1) 6 (8 2) 10
      (9 0) 1 (9 1) 4 (9 2) 6
      (10 0) 6 (10 1) 8 (10 2) 8
      (11 0) 4 (11 1) 5 (11 2) 5
      (12 0) 0
]
CONSO: [(1 0 1) 0 (1 0 2) 0 (1 0 3) 0 (1 0 4) 0
         (2 0 1) 0 (2 0 2) 4 (2 0 3) 3 (2 0 4) 0 (2 1 1) 0 (2 1 2) 4 (2 1 3) 0 (2 1 4) 7 (2 2 1) 0 (2 2 2) 3 (2 2 3) 0 (2 2 4) 7
         (3 0 1) 0 (3 0 2) 10 (3 0 3) 4 (3 0 4) 0 (3 1 1) 0 (3 1 2) 5 (3 1 3) 3 (3 1 4) 0 (3 2 1) 0 (3 2 2) 4 (3 2 3) 0 (3 2 4) 7
         (4 0 1) 3 (4 0 2) 0 (4 0 3) 0 (4 0 4) 7 (4 1 1) 1 (4 1 2) 0 (4 1 3) 7 (4 1 4) 0 (4 2 1) 0 (4 2 2) 8 (4 2 3) 0 (4 2 4) 6
         (5 0 1) 7 (5 0 2) 0 (5 0 3) 8 (5 0 4) 0 (5 1 1) 6 (5 1 2) 0 (5 1 3) 0 (5 1 4) 8 (5 2 1) 4 (5 2 2) 0 (5 2 3) 8 (5 2 4) 0
         (6 0 1) 0 (6 0 2) 4 (6 0 3) 6 (6 0 4) 0 (6 1 1) 0 (6 1 2) 4 (6 1 3) 0 (6 1 4) 3 (6 2 1) 2 (6 2 2) 0 (6 2 3) 1 (6 2 4) 0
         (7 0 1) 10 (7 0 2) 0 (7 0 3) 10 (7 0 4) 0 (7 1 1) 0 (7 1 2) 5 (7 1 3) 0 (7 1 4) 4 (7 2 1) 6 (7 2 2) 0 (7 2 3) 0 (7 2 4) 4
         (8 0 1) 5 (8 0 2) 0 (8 0 3) 0 (8 0 4) 8 (8 1 1) 0 (8 1 2) 7 (8 1 3) 7 (8 1 4) 0 (8 2 1) 4 (8 2 2) 0 (8 2 3) 6 (8 2 4) 0
         (9 0 1) 6 (9 0 2) 0 (9 0 3) 0 (9 0 4) 6 (9 1 1) 6 (9 1 2) 0 (9 1 3) 10 (9 1 4) 0 (9 2 1) 3 (9 2 2) 0 (9 2 3) 10 (9 2 4) 0
         (10 0 1) 10 (10 0 2) 0 (10 0 3) 0 (10 0 4) 4 (10 1 1) 0 (10 1 2) 4 (10 1 3) 6 (10 1 4) 0 (10 2 1) 9 (10 2 2) 0 (10 2 3) 0 (10 2 4) 3
         (11 0 1) 4 (11 0 2) 0 (11 0 3) 0 (11 0 4) 7 (11 1 1) 0 (11 1 2) 9 (11 1 3) 0 (11 1 4) 4 (11 2 1) 3 (11 2 2) 0 (11 2 3) 8 (11 2 4) 0
         (12 0 1) 0 (12 0 2) 0 (12 0 3) 0 (12 0 4) 0
]
MODES: [(1) [0] (2) [0 1 2] (3) [0 1 2] (4) [0 1 2] (5) [0 1 2] (6) [0 1 2] (7) [0 1 2] (8) [0 1 2] (9) [0 1 2] (10) [0 1 2] (11) [0 1 2] (12) [0] ]
Back to examples browserPrevious example
© Copyright 2023 Fair Isaac Corporation.