Dynamic Data Scheduling of a Flexible Industrial Job Shop Based on Digital Twin Technology

Table 2

Comparison of resource allocation results of three algorithms scheduling.

Production line		1	2	3	4	5
Number of workpieces		20	30	20	25	30
Number of machines		20	15	20	20	20
		920	1,155	935	1,036	1,208
Paper method		918	1,158	940	1,035	1,210
Reference [9] method		928	1,165	955	1,064	1,231
Reference [10] method		901	1,267	980	1,143	1,341

Note. in Table 2 represents the Pareto optimal solution, which refers to the optimal resource scheduling result in an ideal state, and represents the optimal solution obtained after 50 iterations of each method.