J30

Dataset File
J30.csv
Description

Dataset proposed in the paper Kolisch, R., & Sprecher, A. (1997). PSPLIB - A project scheduling problem library. European Journal of Operational Research, 96(1), 205-216. https://doi.org/10.1016/S0377-2217(96)00170-1

Number of instances
480
Format
sm
Statistics
Set statistics:
Number of instances: 480
- Solved (exact proc.): 480 (100.00%)
- Closed (LB=UB): 480 (100.00%)
- Open (LB<UB): 0 (0.00%)
Average deviation over CPM:
- Lower bound: 13.37%
- Upper bound: 13.37%
Sum of lower bounds: 28316
Sum of upper bounds: 28316
Open time units: 0 (0.00%)
Avg CPU lower bounds: 0.111s (max 11.200s)
Avg CPU upper bounds: 0.134s (max 11.200s)
Avg CPU optimal sol.: 0.134s (max 11.200s)
Reference 1:
- Lower bounds: 264 (55.00%)
- Upper bounds: 480 (100.00%)
- Optimal solutions: 480 (100.00%)
RecordSets
Record sets:
ID;1
Author(s); Demeulemeester, E. and Herroelen, W.
Reference;Demeulemeester, E., & Herroelen, W. (1992). A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Science, 38(12), 1803-1818. http://www.jstor.org/stable/2632711
Date; 1992/01/01
Hardware / software; Stevin Supercomputer Infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 60 second(s)
Submission date; 2017/5/19
Relevant Results
J30_DH
Best Known Solutions
/index.php/sites/default/files/datasets/J30_BKS.csv
Original Instances
PSPLIB Instance files
File Header
Title;J30
Description;Dataset proposed in the paper Kolisch, R., & Sprecher, A. (1997). PSPLIB - A project scheduling problem library. European Journal of Operational Research, 96(1), 205-216. https://doi.org/10.1016/S0377-2217(96)00170-1
Number;480
Format;sm
Date