A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems

Author

Chandrasekaran, S. ; Ponnambalam, S.G. ; Suresh, R. Kumar ; Vijayakumar, N.

Author_Institution

Dept. of Mech. Eng., Ramakrishna Mission, Coimbatore

fYear

2006

fDate

7-9 June 2006

Firstpage

1

Lastpage

6

Abstract

This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective

Keywords

flow shop scheduling; particle swarm optimisation; NEH heuristic; flow shop scheduling; hybrid discrete particle swarm optimization; job indices; permutation encoding; Buffer storage; Iterative algorithms; Job shop scheduling; Manufacturing; Optimization methods; Particle swarm optimization; Processor scheduling; Scheduling algorithm; Throughput; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Cybernetics and Intelligent Systems, 2006 IEEE Conference on

Conference_Location

Bangkok

Print_ISBN

1-4244-0023-6

Type

conf

DOI

10.1109/ICCIS.2006.252316

Filename

4017875