The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

Table 14

Performance of the heuristics for = 5.

	10	20	30	40	50	60	70	80
Gap	5.79	7.18	5.73	3.08	1.77	1.68	1.34	0.84
Time	1.66	31.35	134.53	222.54	300.07	681.81	1391.61	881.23
Opt	20	10	10	0	10	40	20	30
Gap	4.94	5.29	6.35	3.44	1.27	1.36	1.82	0.94
Time	1.62	25.63	170.30	213.26	319.76	606.98	1228.84	1652.91
Opt	20	10	10	0	10	20	10	50
Gap	3.86	4.43	4.93	2.36	0.73	0.91	1.23	0.55
Time	2.10	35.78	233.55	285.89	291.89	851.41	1882.48	1485.87
Opt	30	20	10	0	20	40	20	60
Gap	5.15	6.21	5.35	3.34	1.38	1.26	1.59	0.90
Time	0.53	6.38	24.17	59.67	152.74	281.72	537.82	907.04
Opt	20	20	10	0	10	40	10	40
Gap	2.90	3.17	3.99	2.40	0.96	1.32	1.40	1.12
Time	9.58	108.53	376.25	529.69	560	498.20	590.75	600
Opt	40	30	20	20	20	40	20	0