Dataset for Dynamic Scheduling Problems with sequence-dependent setup times
Published: 1 May 2020| Version 1 | DOI: 10.17632/v6f24p58cw.1
The data set is made up of independent files. The name of each file has the form IxxnyyDyn-zz, where xx indicates the total number of jobs, yy the percentage of dynamism and zz the instance number within the group. Each group contains 25 replicates for each combination of total number of jobs and percentage of dynamism. Each file contains the total number of jobs (nbJobs), the optimal value without considering the release times (LB), the makespan value for the best solution found for the dynamic problem, the vector of processing times (ProcessingTimes), the setup time matrix (SetupTimes), the vector of job release times (ReleaseTimes) and the job sequence for the best solution found for the dynamic problem.