A new approach based on Global Velocity Particle Swarm Optimization to solve job-shop scheduling problems, PSO-VG-JSSP

2016 ◽  
Author(s):  
Sana Khalfa ◽  
Nizar Rokbani ◽  
Achraf Jabeur Telmoudi ◽  
Lotfi Nabli
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Scheduling Problems ◽  
Swarm Optimization ◽  
New Approach ◽  
Shop Scheduling

A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS

2005 ◽  
Vol 02 (03) ◽  
pp. 419-430 ◽  
Author(s):  
H. W. GE ◽  
Y. C. LIANG ◽  
Y. ZHOU ◽  
X. C. GUO
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Traditional Scheduling ◽  
Benchmark Problems ◽  
Scheduling Problems ◽  
Swarm Optimization ◽  
Shop Scheduling ◽  
Novel Concept

A novel particle swarm optimization (PSO)-based algorithm is developed for job-shop scheduling problems (JSSP), which are the most general and difficult issues in traditional scheduling problems. Our goal is to develop an efficient algorithm based on swarm intelligence for the JSSP. Thereafter a novel concept for the distance and velocity of particles in the PSO is proposed and introduced to pave the way for the JSSP. The proposed algorithm effectively exploits the capabilities of distributed and parallel computing systems, with simulation results showing the possibilities of high quality solutions for typical benchmark problems.

Sign in / Sign up

Export Citation Format

Share Document