International Journal of Societal Applications of Computer Science Vol 1 Issue 1 November 2012 Vanita G. Tonge et.al. 39 www.ijsacs.org Permutation flowshop scheduling problem using DE: A Survey Vanita G. Tonge, Prof.P.S.Kulkarni computer Tecnology , RCERT , chandrpur computer Tecnology,RCERT,chandrpur Abstract— Presently, Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. There have been increasing interests on permutation flowshop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. To solve PFSP problem many researchers have used different EVs algorithm such as ACO, PSO, GA. Out of such evolutionary algorithm DE is the best solution. In this contribution, we try to improve the performance of DE by using dynamic initialization of mutation factor. Keywords— scheduling,permutation,DE,optimization,evolutionary algorithm. I. INTRODUCTION Differential evolution (DE) is one of the latest evolutionary optimization methods proposed by Storn & Price [1]. Like other evolutionary-type algorithms, DE is a population-based and stochastic global optimizer. In a DE algorithm, candidate solutions are represented by chromosomes based on floating-point numbers. In the mutation process of a DE algorithm, the weighted difference between two randomly selected population members is added to a third member to generate a mutated solution. Then, a crossover operator follows to combine the mutated solution with the target solution so as to generate a trial solution. Thereafter, a selection operator is applied to compare the fitness function value of both competing solutions, namely, target and trial solutions to determine who can survive for the next generation. Since DE was first introduced to solve the Chebychev polynomial fitting problem by Storn & Price [1]. The entire permutation flow shop scheduling problem (PFSP) is an abstract of production problems in the industry, which is widely used in the practical production, especially manufacture enterprises with the volume-produce back ground [2]. And thus its effective solutions are significant to improve the resources utilization and benefit of the enterprises..The Permutation Flowshop Sequencing Problem (PFSP) basically deals with finding a permutation of jobs on machines such that certain performance measures such that makespan, flowtime, terdiness etc will be minimized and the same job permutation applies to each machine. Flowshop problems have attracted the attention of researchers since the proposal of the problem by Johnson [1]. Among the practical performance measures, the minimization of makespan are known to lead to the minimization of total production run, stable utilization of resources, rapid turn-around of jobs, and the minimization of work-in-process (WIP) inventory. The formulation of the PFSP can be given as follows: Given the processing times p jk for job j and machine k, and a job permutation  ={  1 , 2 ,..., n } where n jobs ( j = 1,2,...,n) will be sequenced through m machines (k =1,2,...,m) , then the problem is to find the best permutation of jobs to be valid for each machine. For n / m/ P / Cmax problem, C( j ,m) denotes the completion time of the job  j on the machine m. Given the job permutation  = { 1 , 2 ,..., n }, the calculation of completion time for the n-job, m-machine problem is given as follows: C(  1 ,1) = P 1 ,1 (I) C(  j ,1) = C(  j-1 ,1) + P j ,1 j=2,….n (II) C(  1 ,k) = C(  1 ,k) + P 1 ,k k=2,….m (III) C(  j ,k) = max {C(  j-1 ,k), C(  j ,k-1)+ P j , k} j=2,….n ; k=2,….m (IV) Then makespan can be defined as C max ( ) = C( n ,m). (V) So, the PFSP with the makespan criterion is to find a permutation  * in the set of all permutations  such that C max (* )  C( n ,m)   The applications of DE on combinatorial optimization problems are still limited, but the past experience of successfully applying DE algorithms to combinatorial problems in the literature [10] has proved the promising of DE on some scheduling problems. For this reason, this research presents a review on differential evolution (DE) algorithm to solve the permutation flowshop scheduling problem with the makespan criterion. The remaining paper is organized as follows. Section 2 introduces the discrete differential evolution (DDE) algorithm. Section 3 present on Control parameters of the DE with PFSP problem, Section 4 Important Variants of DE for Single-Objective Optimization, DE with Permutation flowshop scheduling problem are discussed in Section 5.Finally, Section 6 summarizes the concluding remark with future scope. II. DIFFERENTIAL EVOLUTIONS: BASIC CONCEPTS In DE community, the individual trial solutions (which constitute a population) are called parameter vectors or genomes. DE operates through the same computational steps as employed by a standard EA. However, unlike traditional