The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

Table 13

Performance of the heuristics for = 4.

	10	20	30	40	50	60	70	80
Gap	3.57	2.15	1.29	0.50	0.72	0.36	0.31	0.09
Time	0.76	6.65	24.78	39.09	119.40	115.96	208.47	229.45
Opt	50	10	30	60	40	60	40	50
Gap	3.88	3.08	1.00	0.49	0.80	0.77	0.80	0.56
Time	0.71	9.03	15.80	23.74	236.01	218.44	379.63	507.28
Opt	40	20	50	50	40	50	40	50
Gap	2.69	2.04	0.84	0.22	0.51	0.33	0.20	0.07
Time	0.92	10.56	29.25	34.45	256.20	140.97	271.56	260.30
Opt	60	30	60	70	60	80	50	70
Gap	3.50	2.99	2.03	0.52	0.97	0.47	0.55	0.44
Time	0.33	3.25	13.91	35.38	95.81	185.55	360.32	628.47
Opt	50	30	20	60	60	70	50	50
Gap	1.62	0.95	0.66	0.25	0.46	0.29	0.48	0.22
Time	2.72	26.90	159.39	149.75	290.63	314.27	482.18	599.55
Opt	60	50	60	90	60	80	50	30