抽象的

Minimization of Total Weighted Delay in Flowshop Sequencing Problem Using Particle Swarm Optimization

S.V.R.Arun, S.Porselvi, DR.A.N.Balaji

Scheduling problems have played a vital role in recent years due to the fast growing of consumer demand for variety,quality, reduced product life cycles, competing with global competition and rapid development of new technologies. The Flow Shop Scheduling Problem (FSP) is one of the most popular scheduling models existing in practice, which is among the hardest combinatorial optimization problems . Particle Swarm Optimization (PSO) is a population based metaheuristic that takes advantage of indvidual and social cooperation in a Swarm. It has been applied to variety of optimization problems because of its simplicity and fast convergence. In this paper PSO is presented to solve the flowshop sequencing problem with an objective of minimizing the Total weighted delay of jobs. For this purpose a heuristic rule called the smallest position value(SPV) is used to enable the continous PSO to be applied in sequencing problems.