Efficient heuristics and metaheuristics for the unrelated parallel machine scheduling problem with release dates and setup times
A new benchmark for R_m | r_i, s_ijk | C_max
In order to study the unrelated parallel machine scheduling problem with release dates and setup times we generated a new benchmark of 1620 instances, divided into three sets (Small, Medium and Large instances).
This benchmark was first introduced in the paper “Efficient heuristics and metaheuristics for the unrelated parallel machine scheduling problem with release dates and setup times” published in GECCO 2022, Boston. You can find the generation protocol details in the paper here.
The following Table shows the summary of the benchmark.
You can download the instances from here. You will need the free software compressor 7zip to open the file.
Mohamed Elamine Athmani
PhD student in computer science
My research interests include scheduling, planning, constraints programming and artificial intelligence.