Scheduling and Logistics course

Problem: Consider the following Flow Shop problem where jobs have processing times in unit of times) as shown in the data below: Job, j pj P2i P3 1 55 26 29 17 27 2 53 55 37 12 53 3 22 14 56 48 38 4 14 46 44 51 53 5 6 52 47 27 8 52 48 426 26 10 7 56 12 23 25 40 8 35 17 15 55 53 9 45 52 27 34 5 7 10 45 56 21 57 36 P4; Psi Use Palmer's step index to generate a sequence that minimizes the makespan. Problem: Consider the following Flow Shop problem where jobs have processing times in unit of times) as shown in the data below: Job, j pj P2i P3 1 55 26 29 17 27 2 53 55 37 12 53 3 22 14 56 48 38 4 14 46 44 51 53 5 6 52 47 27 8 52 48 426 26 10 7 56 12 23 25 40 8 35 17 15 55 53 9 45 52 27 34 5 7 10 45 56 21 57 36 P4; Psi Use Palmer's step index to generate a sequence that minimizes the makespan