A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan

DOI10.1016/j.amc.2006.05.168zbMath1112.90029MaRDI QIDQ865544

Xingsheng Gu, Bin Jiao, Zhigang Lian

Publication date: 19 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.168

zbMATH Keywords

job-shop scheduling; particle swarm optimization; SPSO algorithm

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm, Minimizing makespan for scheduling stochastic job shop with random breakdown, Cellular particle swarm optimization, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, A hybrid particle swarm optimization approach for the sequential ordering problem, Mathematical model for cyclic scheduling with work-in-process minimization, An orthogonal-array-based particle swarm optimizer with nonlinear time-varying evolution, A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan, Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times

Cites Work

• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• A genetic algorithm for the job shop problem
• A genetic algorithm applied to a classic job-shop scheduling problem