A Dynamic Scheduling Method for Logistics Tasks Oriented to Intelligent Manufacturing Workshop

Table 5

The information of the request machines and the free time of each AGV in the five experiments.

Experiment 1	j	1	2	3	4	5	6	7	8	9	10	11	12	13
	k	57	18	27	67	25	49	28	43	30	60	82	44	34
	j	14	15	16	17	18	19	20	21	22	23	24	25	26
	k	59	20	45	81	15	62	16	69	55	75	64	61	46
	i	1	2	3	4	5	6	7	8
	Tfri	0	6	13	22	27	33	34	42
Experiment 2	j	1	2	3	4	5	6	7	8	9	10	11	12	13
	k	38	34	46	26	61	74	50	47	59	53	71	28	73
	j	14	15	16	17	18	19	20	21	22	23	24	25	26
	k	21	55	27	57	60	23	43	51	31	80	36	82	40
	i	1	2	3	4	5	6	7	8
	Tfri	0	2	10	13	18	22	27	31
Experiment 3	j	1	2	3	4	5	6	7	8	9	10	11	12	13
	k	57	48	73	40	41	42	47	32	26	45	33	18	64
	j	14	15	16	17	18	19	20	21	22	23	24	25	26
	k	71	38	21	17	14	34	23	62	46	44	65	29	61
	i	1	2	3	4	5	6	7	8
	Tfri	0	11	12	19	23	30	33	38
Experiment 4	j	1	2	3	4	5	6	7	8	9	10	11	12	13
	k	28	43	60	82	69	55	64	30	15	27	61	50	36
	j	14	15	16	17	18	19	20	21	22	23	24	25	26
	k	80	46	41	51	48	38	21	71	14	44	29	18	73
	i	1	2	3	4	5	6	7	8
	Tfri	0	7	9	14	18	27	33	36
Experiment 5	j	1	2	3	4	5	6	7	8	9	10	11	12	13
	k	21	25	37	43	52	78	80	27	53	58	63	59	16
	j	14	15	16	17	18	19	20	21	22	23	24	25	26
	k	19	66	70	74	75	39	47	68	31	32	46	55	22
	i	1	2	3	4	5	6	7	8
	Tfri	0	3	11	17	20	22	30	37