Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine

Table 1

The performance of the simulated-annealing algorithms at (𝑛,𝜏,𝛾,le)=(12,0.25,0.25,80).

λ	SA1		SA2		SA3		SA4		SA5
	Mean	Max	Mean	Max	Mean	Max	Mean	Max	Mean	Max
0.20	0.0252	0.6711	0.0326	1.2731	0.0294	1.2731	0.0239	1.2731	0.0020	0.2014
0.40	0.0539	1.9013	0.0724	1.9013	0.0911	1.9013	0.1352	5.8067	0.0151	1.4364
0.60	0.0433	0.9016	0.0954	5.5725	0.0803	4.4405	0.0919	4.6113	0.0103	0.3001
0.80	0.0595	1.8690	0.0412	0.4131	0.0465	1.6664	0.0543	1.7206	0.0062	0.1241
1.00	0.0710	3.7936	0.1013	3.7936	0.0994	3.7936	0.0907	3.7936	0.0429	3.7936
1.25	0.0423	0.2853	0.1068	5.7572	0.0433	0.4495	0.0371	0.6049	0.0045	0.0665
1.50	0.0359	0.4688	0.0414	0.2745	0.0331	0.3646	0.0331	0.2364	0.0048	0.0651
1.75	0.0671	3.3128	0.0414	0.3602	0.0671	3.3128	0.0413	0.3486	0.0057	0.1112
2.00	0.0358	0.3843	0.0329	0.3610	0.0504	0.3250	0.0314	0.3368	0.0091	0.2887
3.00	0.0355	0.2558	0.0420	0.2762	0.0321	0.2738	0.0316	0.3117	0.0066	0.1416