Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan

In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of minimizing the makespan. A discussion on implementation details of DPSO algorithm is presented. The proposed algorithm has been applied to a set o...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Natural Computation pp. 572 - 581
Main Authors Rameshkumar, K., Suresh, R. K., Mohanasundaram, K. M.
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Constructive Heuristic
Exact sciences and technology
Flowshop Schedule Problem
Large Size Problem
Local Search
Optimal Power Flow
Local search
Permutation
Heuristic method
Discrete programming
Flow shop
Swarm intelligence
Scheduling
Makespan
Online AccessGet full text

Cover

More Information
Summary:In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of minimizing the makespan. A discussion on implementation details of DPSO algorithm is presented. The proposed algorithm has been applied to a set of benchmark problems and performance of the algorithm is evaluated by comparing the obtained results with the results published in the literature. Further, it is found that the proposed improvement heuristic algorithm performs better when local search is performed. The results are presented.
ISBN:9783540283201
354028320X
3540283234
9783540283232
ISSN:0302-9743
1611-3349
DOI:10.1007/11539902_70