Benchmarks for shop scheduling problems

@article{citeulike:1814402, abstract = {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.}, author = {Demirkol, Ebru and Mehta, Sanjay and Uzsoy, Reha}, citeulike-article-id = {1814402}, doi = {10.1016/S0377-2217(97)00019-2}, journal = {European Journal of Operational Research}, keywords = {download, ea, priority-rules}, month = {August}, number = {1}, pages = {137--141}, posted-at = {2007-10-24 08:16:01}, priority = {2}, title = {Benchmarks for shop scheduling problems}, url = {http://dx.doi.org/10.1016/S0377-2217(97)00019-2}, volume = {109}, year = {1998} }

TY - JOUR ID - citeulike:1814402 L3 - citeulike-article-id:1814402 N2 - 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. IS - 1 JF - European Journal of Operational Research EP - 141 TI - Benchmarks for shop scheduling problems VL - 109 SP - 137 KW - download KW - ea KW - priority-rules AU - Demirkol, Ebru AU - Mehta, Sanjay AU - Uzsoy, Reha PY - 1998/08/16/ UR - http://dx.doi.org/10.1016/S0377-2217(97)00019-2 ER -