bouquet field horses horses horses

Single Machine Scheduling with Dynamic Arrival Time with common due dates and setup times(2015/5/21)

We propose a new testing set of single machine scheduling problem. There are three processing time types, including low, medium, and high. They are put into different folders. Besides, the job sizes are ranging from 10, 15, to 200 and each job size has 15 instance replications. In each instance, the first row is the processing time of each job. Then, the n by n array is the setup time. Take the type high with the 10_1.etp for example, if job 1 is before job 2, the setup time is 120. Then, the last row is the dynamic arrival time of each job. Please download the instances below.

  1. Instances