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

Published: 4 October 2020| Version 1 | DOI: 10.17632/nrkx7467tf.1

Contributor:

Artem Fomin

## Description

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 function value, corresponding optimal schedule and time in which it was found by the algorithm described in the paper. For more detailed dataset description, see "README.txt" file or the original article.

## Files

## Categories

Combinatorial Optimization