Benchmarks for shop scheduling problems

In this paper we present extensive sets of randomly generated test problems for the problems of minimizing makespan (Cmax) and maximum lateness (Lmax) in flow shops and job shops. The 600 problems include three different types of routings, four different due date configurations and a variety of problem sizes. The problems, as well as the best existing solution and a lower bound on the optimal value are available on the world-wide web.