Biobjective Scheduling for Joint Parallel Machines with Sequence-Dependent Setup by Taking Pareto-Based Approach

Table 4

Comparison of objective value and scheduling time between mathematical model, ANNS, and MTS methods on the reference problems, i.e., 06J02M03P, 06J02M06P, and 09J02M03P.

Case	Run	Objective values			Scheduling time (H:M:S), S
		Math	ANNS	MTS	Math	ANNS	MTS
06J02M03P	1	16,981	17,770	18,006	00:00:38	33.5	33.5
	2		17,562	17,541		30.5	34.2
	3		18,634	17,918		29.5	32.3
	4		17,074	17,918		34.5	31.9
	5		17,234	17,986		33.5	32.0
	6		17,394	18,006		36.5	32.0
	AVG		17,611	17,896		33.0	32.7
			630 (3.71%)	915 (5.39%)
06J02M06P	1	257,251	262,467	282,864	95:23:59	38.5	36.7
	2		263,675	271,934		37.4	36.5
	3		269,307	259,421		38.1	37.2
	4		263,458	258,110		37.2	37.2
	5		265,133	282,864		39.2	36.5
	6		265,858	264,076		37.3	36.7
	AVG		264,983	269,878		38.0	36.8
			7732 (3.01%)	12,627 (4.91%)
09J02M03P	1	74,536	75,834	76,878	101:23:12	35.1	33.5
	2		78,945	76,696		34.0	132.0
	3		75,912	74,952		34.0	41.0
	4		75,289	80,352		34.0	35.9
	5		79,981	77,408		41.0	32.2
	6		79,531	75,395		41.0	32.1
	AVG		77,582	76,947		36.5	51.1
			3046 (4.09%)	2411 (3.23%)