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

Table 4

The computational results under tight due dates (𝑓=1.1).

Instance set no.	Size (𝑛×𝑚)	HDE			GLS
		RTWT𝑏	RTWT𝑤	RTWT𝑚	𝑅𝑇𝑊𝑇𝑏	RTW𝑇𝑤	RTWT𝑚
1	10×10	1.000	1.235	1.112	1.092	1.249	1.123
2	20×5	1.000	1.207	1.113	1.083	1.253	1.158
3	10×20	1.000	1.262	1.115	1.028	1.343	1.132
4	20×10	1.000	1.235	1.135	1.091	1.318	1.181
5	20×15	1.000	1.252	1.139	1.033	1.274	1.179
6	50×6	1.000	1.213	1.119	1.061	1.329	1.180
7	20×20	1.000	1.219	1.126	1.099	1.329	1.195
8	40×10	1.000	1.180	1.124	1.097	1.367	1.216
9	50×10	1.000	1.194	1.137	1.023	1.359	1.213
10	100×5	1.000	1.256	1.162	1.010	1.324	1.209