A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem

2013 ◽  
Vol 18 (11) ◽  
pp. 2271-2282 ◽  
Author(s):  
Chun-Lung Chen ◽  
Shin-Ying Huang ◽  
Yeu-Ruey Tzeng ◽  
Chuen-Lung Chen
Keyword(s):  
Particle Swarm Optimization Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Discrete Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Discrete Particle ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop

Discrete Particle Swarm Optimization Algorithm for Lot-Streaming No-Wait Flow Shop Scheduling Problem

2012 ◽  
Vol 538-541 ◽  
pp. 863-868 ◽  
Author(s):  
Lin Yang ◽  
Yu Xia Pan
Keyword(s):  
Particle Swarm Optimization ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Discrete Particle Swarm Optimization ◽  
Lot Streaming ◽  
Swarm Optimization ◽  
Discrete Particle ◽  
Shop Scheduling ◽  
No Wait

This paper proposed discrete particle swarm optimization(DPSO) algorithm to solve lot-streaming no-wait flow shop scheduling problem(LNFSP) with the objective of the maximum completion time. The natural encoding scheme based on job permutation and newly-designed methods were adopted to produce new individuals . After the DPSO-based exploration, a efficient fast local search based on swap neighborhood structure is used to enhance the exploitation capability. Simulation results show the effectiveness of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document