Benchmark problems of robustness optimization

General job-shop problems for robustness optimization

No.	Problem Name	Min. Cmax	No. makespan- minimum active schedules	Min. robustness	Max. robustness
	la01	666	> 50,000,000	12	(41)
2	la02	655	21,310	17	42
3	la03	597	640	40	43
4	la04	590	3,738	24	38
	la05	593	> 50,000,000	11	(36)
1	ka01	588	> 50,000,000	12	(43)
5	ka02	589	28,826	15	41
6	ka03	681	20,190,485	15	42
7	ka04	603	3,072	33	41
8	ka05	591	400	43	46
9	ka06	652	1,656,988	11	42
10	ka07	650	325,315	15	44
	ka08	855	145,609	19	48
	ka09	731	> 50,000,000	14	(51)
	ka10	635	> 50,000,000	14	(46)

For more information about robustness optimization, please refer to the following papers:

Katsumi Morikawa, Yuuki Kawata, and Nobuto Nakamura,
"Robustness of the Minimum Makespan Schedules in a Job-Shop,"
Proceedings of the 1999 IEEE International Conference on Systems, Man, and Cybernetics,
October 12-15, Tokyo, Japan, pp. IV-540 - IV-545 (1999).
Yuuki Kawata, Katsumi Morikawa, Katsuhiko Takahashi, and Nobuto Nakamura,
"Robustness optimization of the minimum makespan schedules in a job shop,"
Proceedings of the Second Asia-Pacific Conference on Industrial Engineering and Management Systems,
October 30-31, Kanazawa, Japan, pp. 221 - 224 (1999).

Feb. 9, 2000
morikawa@pel.sys.hiroshima-u.ac.jp