A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem

Table 3

The computational results under moderate due dates (𝑓=1.3).

Instance set no.	Size (𝑛×𝑚)	HDE			GLS
		RTWT𝑏	RTWT𝑤	RTWT𝑚	RTWT𝑏	RTWT𝑤	RTWT𝑚
1	10×10	1.000	1.181	1.090	1.085	1.248	1.124
2	20×5	1.000	1.146	1.099	1.084	1.266	1.151
3	10×20	1.000	1.165	1.117	1.010	1.205	1.144
4	20×10	1.000	1.200	1.153	1.005	1.306	1.178
5	20×15	1.000	1.218	1.101	1.094	1.279	1.154
6	50×6	1.000	1.164	1.115	1.095	1.252	1.139
7	20×20	1.000	1.184	1.110	1.087	1.324	1.167
8	40×10	1.000	1.166	1.086	1.086	1.214	1.118
9	50×10	1.000	1.147	1.096	1.010	1.262	1.130
10	100×5	1.000	1.195	1.086	1.080	1.329	1.159