Experimental data for SPAA'24 submission "New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines"
Each file has the following columns:
- File name
- Running time in seconds
- Found makespan
$n$ $m$ $n/m$ - (Files beginning with
vnodes_*only) Number of explored nodes - A few zeroes which have no meaning
Source code will be linked here once corresponding full paper has been published