Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Table 16

Performance of MOMILP model and primary GA and SA algorithms in dealing with small-scale problems (.).

Problem	Z				Deviation from optimum (%)			Solving time (s)
	m, n, b	MOMILP	GA	SA	MOMILP	GA (%)	SA (%)	MOMILP	GA	SA
1	2, 4, 8	449.74	449.74	510.53	0	0.00	13.52	11	84	1
2	3, 4, 8	347.31	350.83	668.90	0	1.02	92.60	60	105	1
3	2, 5, 10	492.95	492.95	726.71	0	0.00	47.42	145	106	1
4	3, 5, 10	382.65	466.38	737.00	0	21.88	92.61	1951	147	2
5	2, 6, 12	848.09	859.43	1415.23	0	1.34	66.87	1386	105	3
6	3, 6, 12	—	1026.97	2375.36	—	—	—	38744	168	4
Average					0	4.85	62.60