A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
DOI10.1016/J.AMC.2006.05.168zbMATH Open1112.90029OpenAlexW2016910224MaRDI QIDQ865544FDOQ865544
Authors: Zhigang Lian, Bin Jiao, Xingsheng Gu
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
Recommendations
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- Job-shop scheduling based on improved particle swarm
- A particle swarm optimization algorithm for job-shop scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (16)
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- Cellular particle swarm optimization
- Job-shop scheduling based on improved particle swarm
- Minimizing makespan for scheduling stochastic job shop with random breakdown
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- An effective new island model genetic algorithm for job shop scheduling problem
- A hybrid particle swarm optimization approach for the sequential ordering problem
- An orthogonal-array-based particle swarm optimizer with nonlinear time-varying evolution
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
- Mathematical model for cyclic scheduling with work-in-process minimization
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal
This page was built for publication: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865544)