Benchmark instances for the preemptive single machine scheduling of equal-length jobs minimizing Total Weighted Completion Time

Artem Fomin
The benchmark is an attachment to the paper "An efficient model for the preemptive single machine scheduling of equal-length jobs" article by Artem Fomin and Boris Goldengorin. Our benchmark provides over a million 1|pmtn;pj=p;rj|∑wjCj problem instances. The instances' size is up to np=800, where n is the number of jobs and p is the common processing time with n in [10, 350] and p in [2, 20]. For each instance we provide the optimal objective...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.