... +4)J(cp)= (L2 + 4 +n)K+3n.i =1 T1 .T1 .u2 1 4K+ 1 11K +1 ,I7K +1 ,IU 1 BK +1 II5K +1 It3K +1 T1 .T1 .4K +1 ,I2K,IU 1 U2K +1 Figure4.(One example withn =2)(b) If there is a schedulecpwith ... flow-shop withi=l4n +2 jobs:t 1 ,i=2(i -I)K + 1, t2,i =(2i -I)K + 1, t3,i=2(i+ I)K + 1, for 1: ::::i :::::n,andt1,i = 1, t2,i = ai-n-2 + 1, t3,i = 1, forn +3 :::::i :::::4n ... 3-partition{U 1 ,U2, • ,Un}then the permutation schedule(n+l,i EU 1 ,n,iEU2, • ,2,iEUn, 1) (Fig. 4) has the finish timen+lW+3i +4)J(cp)= (L2 + 4 +n)K+3n.i =1 T1 .T1 .u2 1 4K+ 1 11K...