Instances of SMSPRDs

The single machine scheduling problem (SMSP) with release dates (SMSPRDs) There are currently six data files. Each file consists of sixteen instances, each instance consists of three lines containing the processing time, release dates, and due dates of jobs. For each job, a processing time pi is randomly generated in the interval [1, 100], and two parameters K1 and K2 are used. If N is the number of jobs, the release date ri is randomly generated in the interval [0, K1 · N], and the due date in the interval [ri + pi, ri + pi + K2 · N]. K1 and K2 are chosen in the set {1, 5, 10, 20}. We generated for N ∈ {50, 100, 300, 500, 700, 1000}. For each combination of N, K1 and K2, one instances are generated, i.e. 16 instances for each value of N.