Results File
Dataset
File Header
Author(s):Vilm Heinz, Petr Vilm, Zdenk Hanzlek
Reference:Heinz, V., Vilim, P., & Hanzalek, Z. (2025). Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks, Computers & Industrial Engineering 209, 111413. https://doi.org/10.1016/j.cie.2025.111413
Date: 2025/08/26
Hardware / software:Unknown
Stop criteria(s):900 seconds
Submission date: 2024/10/10
Statistics
Nothing changed since there are no new lower bounds, upper bounds nor optimal solutions.
Instances: 41
Lower Bounds: 41
- Average deviations:
- over CPM: 46.12%
- below best LB: 0.39%
- below best UB: 4.58%
- Best Known: 33 (80.49%)
- Closed (using best UBs): 0 (0.00%)
- Sum of time units: 5031
- Open time units:
- to LBs: 19 (0.38%)
- to UBs: 248 (4.70%)
Instances: 41
Lower Bounds: 41
- Average deviations:
- over CPM: 46.12%
- below best LB: 0.39%
- below best UB: 4.58%
- Best Known: 33 (80.49%)
- Closed (using best UBs): 0 (0.00%)
- Sum of time units: 5031
- Open time units:
- to LBs: 19 (0.38%)
- to UBs: 248 (4.70%)
Date