The main objective of many authors is to find an optimum sequence, which can provide minimum makespan in a Permutation Flow Shop (PFS). In this venture, a new Exponential Distribution Technique (EPDT) is proposed, under the mathematical and computational features. This paper deals with characteristic study of EPDT over the existing algorithms. The taillard benchmark problems are solved for the general comparison. This analysis have been tabulated and graphically represented along with the cumulative performance of it. The solution of this work have shown that Exponential Distribution Technique has better performance in finding an optimal sequence in a permutation flow shop. © Pakistan Academy of Sciences.