A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
From MaRDI portal
Publication:865544
DOI10.1016/j.amc.2006.05.168zbMath1112.90029OpenAlexW2016910224MaRDI QIDQ865544
Zhigang Lian, Xingsheng Gu, Bin Jiao
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time ⋮ An effective new island model genetic algorithm for job shop scheduling problem ⋮ Minimizing makespan for scheduling stochastic job shop with random breakdown ⋮ 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 ⋮ Cellular particle swarm optimization ⋮ A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan ⋮ An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ An orthogonal-array-based particle swarm optimizer with nonlinear time-varying evolution ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
Cites Work
This page was built for publication: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
