 |
RCPSP |
This web site contains files with results of algorithms for
resource-constrained project scheduling problems (RCPSP,
RCPSP/max, MRCPSP/max) as well as instances for the
RCPSP with transfer times.
The used data sets are the PROGEN data sets from the
PSPLIB
Lower bound LB2 for RCPSP based on LP of Mingozzi et al. [1998]
and immediate selection (Brucker, Knust, Schoo, Thiele [1998]),
calculated with column generation by Baar, Brucker, Knust [1998]:
lp.60:
Lower bounds for the PROGEN data set with n=60
lp.90:
Lower bounds for the PROGEN data set with n=90
Lower bound LB for RCPSP based on constraint propagation (immediate selection)
and linear programming published in Brucker, Knust [2000]:
lpcp.60:
Lower bounds for the PROGEN data set with n=60
lpcp.90:
Lower bounds for the PROGEN data set with n=90
lpcp.120:
Lower bounds for the PROGEN data set with n=120
Lower bound for MRCPSP/max based on constraint propagation
and linear programming (Brucker, Knust [2003]):
mrcpspmax.30:
Lower bounds for the PROGEN/max data set with n=30
mrcpspmax.50:
Lower bounds for the PROGEN/max data set with n=50
rcpspmax.c:
Lower bounds for the PROGEN/max data set C with n=100
rcpspmax.d:
Lower bounds for the PROGEN/max data set D with n=100
Tabu-search algorithm based on critical arcs,
published in Baar, Brucker, Knust [1998]:
tslist.30:
Results for the PROGEN data set with n=30
tslist.60:
Results for the PROGEN data set with n=60
tslist.90:
Results for the PROGEN data set with n=90
Tabu-search algorithm based on parallelity,
published in Baar, Brucker, Knust [1998]:
tspara.30:
Results for the PROGEN data set with n=30
tspara.60:
Results for the PROGEN data set with n=60
tspara.90:
Results for the PROGEN data set with n=90
Instances of RCPSP with transfer times,
used in Poppenborg, Knust [2016]:
rcpsp_tt_instances.zip
rcpsp_tt_30.txt:
Results for the data set with n=30
rcpsp_tt_60.txt:
Results for the data set with n=60
rcpsp_tt_90.txt:
Results for the data set with n=90
rcpsp_tt_120.txt:
Results for the data set with n=120
Baar, Brucker, Knust [1998]:
Tabu-search algorithms and lower bounds for the resource-constrained project
scheduling problem,
in: S.Voss, S.Martello, I.Osman, C.Roucairol (eds.):
Meta-heuristics: Advances and Trends in Local Search Paradigms for
Optimization, Kluwer, 1-18.
Brucker, Knust, Schoo, Thiele [1998]:
A Branch-and-bound algorithm for the resource-constrained project scheduling problem,
European Journal of Operational Research 107, 272-288.
Brucker, Knust [2000]:
A linear programming and constraint propagation-based lower bound for
the RCPSP,
European Journal of Operational Research 127, 355-362.
Brucker, Knust [2003]:
Lower bounds for resource-constrained project scheduling problems,
European Journal of Operational Research 149, 302-313.
Mingozzi, Maniezzo, Ricciardelli, Bianco [1998]:
An exact algorithm for project scheduling with resource constraints based on a
new mathematical formulation,
Management Science 44, 714-729.
Poppenborg, Knust [2016]:
A flow-based tabu search algorithm for the RCPSP with transfer times,
OR Spectrum 38, 305-334.