Each product i: A - E follow the same sequence through a permutation flow shop (1-2-3-4-5) and have transition times where both the current machine k and machine k+1 are occupied ((1,2), (2,3), (3,4), (4,5)). The processing times of each project on each machine along with the transition times are given in the table. Find the minimum delay time dij needed to go from product A to all other projects so that there is no overlap of projects on any of the machines. I believe this is a no-wait permutation flow shop model but am unable to find the correct answers.

pik 1 (1,2) 2 (2,3) 3(3,4) 4|(4,5) 5 23 83 13 151 110 157 14 A B | 78 78 77 77 23 83 13 151 110 14 157 164 77 18 79 9 101 60 14 80 0 252 12 196 153 213 16 115 E 150 10 137 10 153 118 161 16 98 pik 1 (1,2) 2 (2,3) 3(3,4) 4|(4,5) 5 23 83 13 151 110 157 14 A B | 78 78 77 77 23 83 13 151 110 14 157 164 77 18 79 9 101 60 14 80 0 252 12 196 153 213 16 115 E 150 10 137 10 153 118 161 16 98