Benchmarks for basic scheduling problems

This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that the paper proposes are: the permutation flow shop, the job shop and the open shop scheduling problems. It restricts orselves to basic problems: the processing times are fixed, there are neither set-up times nor due dates nor release dates, etc. Then, the objective is the minimization of the makespan.