A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem

2010 ◽  
Vol 42 (7) ◽  
pp. 641-670 ◽  
Author(s):  
Rui Zhang ◽  
Cheng Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Divide And Conquer ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Swarm Optimization ◽  
Shop Scheduling

A Novel Immune-PSO Algorithm for Job Shop Scheduling

2010 ◽  
Vol 129-131 ◽  
pp. 261-265
Author(s):  
Lu Hong ◽  
Jing Yang
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Clonal Selection Algorithm ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Swarm Optimization ◽  
Shop Scheduling ◽  
Wide Range

The job shop scheduling problem (JSSP) is one of the most difficult problems, as it is classified as an NP-complete one. Particle Swarm Optimization, a nature-inspired evolutionary algorithm, has been successful in solving a wide range of real-value optimization problems. However, little attempts have been made to extend it to discrete problems. In this paper, a new particle swarm optimization method based on the clonal selection algorithm is proposed to avoid premature convergence and guarantee the diversity of the population. Experimental results indicate that the proposed algorithm is highly competitive, being able to produce better solutions than GA and CLONALG in several cases, and is a viable alternative for solving efficiently job shop scheduling problem.

scholarly journals A Hybrid Algorithm Based on Particle Swarm Optimization and Artificial Immune for an Assembly Job Shop Scheduling Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Hui Du ◽  
Dacheng Liu ◽  
Mian-hao Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Artificial Immune ◽  
Swarm Optimization ◽  
Shop Scheduling ◽  
Hybrid Particle Swarm Optimization

To produce the final product, parts need to be fabricated in the process stages and thereafter several parts are joined under the assembly operations based on the predefined bill of materials. But assembly relationship between the assembly parts and components has not been considered in general job shop scheduling problem model. The aim of this research is to find the schedule which minimizes completion time of Assembly Job Shop Scheduling Problem (AJSSP). Since the complexity of AJSSP is NP-hard, a hybrid particle swarm optimization (HPSO) algorithm integrated PSO with Artificial Immune is proposed and developed to solve AJSSP. The selection strategy based on antibody density makes the particles of HPSO maintain the diversity during the iterative process, thus overcoming the defect of premature convergence. Then HPSO algorithm is applied into a case study development from classical FT06. Finally, the effect of key parameters on the proposed algorithm is analyzed and discussed regarding how to select the parameters. The experiment result confirmed its practice and effectiveness.

Sign in / Sign up

Export Citation Format

Share Document