The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

Table 15

Performance of the heuristics for = 6.

	10	20	30	40	50	60	70	80
Gap	9.47	7.67	6.91	5.14	3.80	1.62	2.76	2.68
Time	3.78	53.16	253.38	728.58	1063.13	1228.46	3719.93	6279.36
Opt	0	0	0	0	0	20	20	20
Gap	9.61	7.43	7.31	5.12	4.57	2.04	2.56	2.72
Time	4.28	49.41	242.64	628.18	1192.89	1173.98	2274.25	5679.16
Opt	0	0	0	10	0	0	20	40
Gap	7.99	6.49	6.23	4.48	3.33	1.27	2.32	2.18
Time	5.85	83.94	412.25	1180.35	1563.44	1476.98	4525.30	7984.64
Opt	0	0	0	10	0	20	30	40
Gap	9.75	8.29	6.90	5.45	4.72	2.55	2.81	2.78
Time	0.87	10.34	40.37	106.24	217.00	453.18	922.69	1491.32
Opt	0	0	0	10	0	10	20	20
Gap	6.39	4.84	5.61	5.05	5.01	3.43	3.31	5.04
Time	16.85	223.17	554.18	553.06	594.42	576.12	600	600
Opt	10	0	10	10	0	10	0	0