A starting-time-based approach to production scheduling with Particle Swarm Optimization

Author(s):  
Jacomine Grobler ◽  
Andries P. Engelbrecht ◽  
Johan W. Joubert ◽  
Schalk Kok
2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Qingquan Jiang ◽  
Xiaoya Liao ◽  
Rui Zhang ◽  
Qiaozhen Lin

A single-machine scheduling problem that minimizes the total weighted tardiness with energy consumption constraints in the actual production environment is studied in this paper. Based on the properties of the problem, an improved particle swarm optimization (PSO) algorithm embedded with a local search strategy (PSO-LS) is designed to solve this problem. To evaluate the algorithm, some computational experiments are carried out using PSO-LS, basic PSO, and a genetic algorithm (GA). Before the comparison experiment, the Taguchi method is used to select appropriate parameter values for these three algorithms since heuristic algorithms rely heavily on their parameters. The experimental results show that the improved PSO-LS algorithm has considerable advantages over the basic PSO and GA, especially for large-scale problems.


Sign in / Sign up

Export Citation Format

Share Document