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

Table 2

The computational results under loose due dates (𝑓=1.5).

Instance set no.	Size (𝑛×𝑚)	HDE			GLS
		RTWT𝑏	RTWT𝑤	RTWT𝑚	RTWT𝑏	RTWT𝑤	RTW𝑇𝑚
1	10×10	1.000	1.150	1.021	1.002	1.187	1.052
2	20×5	1.000	1.128	1.085	1.004	1.136	1.073
3	10×20	1.000	1.149	1.099	1.008	1.144	1.117
4	20×10	1.000	1.129	1.065	1.010	1.113	1.098
5	20×15	1.000	1.120	1.054	1.000	1.118	1.075
6	50×6	1.000	1.126	1.072	1.017	1.103	1.087
7	20×20	1.000	1.115	1.034	1.013	1.119	1.068
8	40×10	1.000	1.119	1.062	1.027	1.122	1.076
9	50×10	1.000	1.103	1.027	1.015	1.130	1.100
10	100×5	1.000	1.121	1.078	1.026	1.126	1.092