1. Vith the sequencing rules for n tasks on 1 machine, determine the optimal sequence The following table contains information about jobs that must be scheduled on a single machine. WORK processin Term g time A 4 20 B 12 30 2 15 D 11 16 E 10 18 F 3 5 G 6 9 Schedule jobs, use sequencing methods a) PEPT b) TOB c) PPP d) ULPT e) TOR f) Construct a comparative table and conclude which is the method that minimizes the total required time based on the total and average traffic and the average delay. 1. Vith the sequencing rules for n tasks on 1 machine, determine the optimal sequence The following table contains information about jobs that must be scheduled on a single machine. WORK processin Term g time A 4 20 B 12 30 2 15 D 11 16 E 10 18 F 3 5 G 6 9 Schedule jobs, use sequencing methods a) PEPT b) TOB c) PPP d) ULPT e) TOR f) Construct a comparative table and conclude which is the method that minimizes the total required time based on the total and average traffic and the average delay