A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm

Table 3

Data on Gari processing job flow.

Job number (𝑖)	Job arrival/h	Volume (tons) 𝑉𝑖	Job due time/hr	PPT	GPT	PRPT	SPT	FrPT
1	13	8	21	5.92	1.44	2.24	1.28	1.76
2	10	10	25	7.4	1.8	2.8	1.6	2.2
3	33	8	56	5.92	1.44	2.24	1.28	1.76
4	38	7	48	5.18	1.26	1.96	1.12	1.54
5	16	2	37	1.48	0.36	0.56	0.32	0.44
6	88	5	100	3.7	0.9	1.4	0.8	1.1
7	16	7	112	5.18	1.26	1.96	1.12	1.54
8	31	12	50	8.88	2.16	3.36	1.92	2.64
9	58	5	67	3.7	0.9	1.4	0.8	1.1
10	79	5	142	3.7	0.9	1.4	0.8	1.1
11	64	10	88	7.4	1.8	2.8	1.6	2.2
12	49	6	116	4.44	1.08	1.68	0.96	1.32
13	57	5	95	3.7	0.9	1.4	0.8	1.1
14	18	10	58	7.4	1.8	2.8	1.6	2.2
15	128	10	140	7.4	1.8	2.8	1.6	2.2
16	88	9	116	6.66	1.62	2.52	1.44	1.98
17	90	5	142	3.7	0.9	1.4	0.8	1.1
18	95	7	115	5.18	1.26	1.96	1.12	1.54
19	129	8	156	5.92	1.44	2.24	1.28	1.76
20	23	4	46	2.96	0.72	1.12	0.64	0.88