A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem

Table 9

The CPU time periods obtained by algorithms for solving FJSP.

Algorithms	DOLGOA	GOA	PSO	Jaya	DE	GWO
MFJS01	6.89	7.53	6.88	4.19	4.18	3.02
MFJS02	6.54	7.81	6.66	4.75	4.26	3.03
MFJS03	7.18	8.20	7.86	5.34	4.86	3.38
MFJS04	7.75	8.52	8.73	5.91	5.45	3.82
MFJS05	7.82	8.51	8.63	6.00	5.50	3.85
MFJS06	8.55	9.06	9.92	6.68	6.16	4.34
MFJS07	10.31	10.57	12.85	8.33	8.37	5.74
MFJS08	11.13	11.16	14.30	8.87	9.02	6.25
MFJS09	12.68	12.28	16.66	10.44	10.57	7.46
MFJS10	13.68	12.99	18.24	10.88	11.34	7.85
SFJS01	3.75	5.70	2.23	1.19	1.36	0.97
SFJS02	3.59	5.32	2.21	1.16	1.34	1.00
SFJS03	4.23	5.58	2.84	1.53	1.67	1.33
SFJS04	4.19	5.72	2.98	1.53	1.75	1.33
SFJS05	4.21	5.81	3.06	4.19	1.70	1.31
SFJS06	5.02	6.22	4.33	4.75	2.52	1.95
SFJS07	5.31	6.53	4.67	5.34	2.86	1.99
SFJS08	5.13	6.65	4.49	5.91	2.67	1.91
SFJS09	5.08	6.51	4.45	6.00	2.56	1.95
SFJS10	5.78	6.95	5.89	6.68	3.35	2.51