A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem

Table 3

Experiment’s results on the set of orb instances.

Instance	Opt	GA [6]		UPLA
		Best	%BSVD	Best	%BSVD	Avg.	%ASVD	Avg. No. of Iters	Avg. CPU Time (sec)
orb01	1059	1077	1.70		0.00	1069	0.93	186	2312
orb02	888	889	0.11	889	0.11	889	0.11	200	2393
orb03	1005	1022	1.69		0.00	1021	1.58	186	2358
orb04	1005		0.00		0.00	1006	0.11	67	796
orb05	887	890	0.34	889	0.23	890	0.32	200	2458
orb06	1010	1021	1.09	1013	0.30	1019	0.93	200	2525
orb07	397		0.00		0.00	399	0.55	178	2096
orb08	899		0.00		0.00	909	1.07	188	2338
orb09	934		0.00		0.00	935	0.05	74	884
orb10	944		0.00		0.00	944	0.00	67	817