Title :
An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance
Author :
Chandrasekaran, S. ; Suresh, R. Kumar ; Ponnambalam, S.G. ; Vijayakumar, N.
Author_Institution :
Dept. of Mech. Eng., Sri Ramakrishna Mission Vidyalaya Polytech Coll., Coimbatore
Abstract :
The problem of scheduling in flowshops with the objective of minimizing makespan, total flowtime and completion time variation is studied in this paper. A simple discrete version of particle swarm optimization algorithm (PSO) is proposed for solving the set of benchmark flowshop scheduling problems proposed by Taillard (1993). The obtained results are better when compared with the results published in the literature.
Keywords :
flow shop scheduling; minimisation; particle swarm optimisation; statistical analysis; completion time variance minimization; makespan minimization; particle swarm optimization algorithm; permutation flowshop scheduling problems; total flowtime minimization; Automation; Computer science education; Educational institutions; Mechanical engineering; Particle swarm optimization; Processor scheduling; Scheduling algorithm; Single machine scheduling; Throughput; Time measurement;
Conference_Titel :
Automation Science and Engineering, 2006. CASE '06. IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
1-4244-0310-3
Electronic_ISBN :
1-4244-0311-1
DOI :
10.1109/COASE.2006.326934
