HUGE Sample Data

General job-shop problems by T. Satake

Values in brackets of the column of Min. Cmax are ( Best known value / Lower bound ).
Problem J is based on the following paper:
Zhou, D. N., V. Cherkassky, T. R. Baldwin, and D. E. Olson, "A neural network approach to job-shop scheduling," IEEE Transactions on Neural Networks, Vol. 2, No. 1, 1991, pp. 175-179.

Oct. 1, 1999
morikawa@pel.sys.hiroshima-u.ac.jp