An improved particle swarm optimization algorithm for flowshop scheduling problem

DOI10.1016/j.ipl.2008.05.010zbMath1191.68112OpenAlexW1988977820MaRDI QIDQ975447

Changsheng Zhang, Xingjun Zhu, Qingyun Yang, Jigui Sun

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.010

zbMATH Keywords

combinatorial problemsmakespanparticle swarm optimizationflow shop scheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Genetic based discrete particle swarm optimization for elderly day care center timetabling ⋮ Reducing network and computation complexities in neural based real-time scheduling scheme ⋮ Optimizing version release dates of research and development long-term processes ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study ⋮ Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization

Cites Work

• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• A new heuristic method for the flow shop sequencing problem
• A language and a program for stating and solving combinatorial problems
• A new constructive heuristic for the flowshop scheduling problem
• New heuristics for no-wait flowshops to minimize makespan.
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• On robust control of uncertain chaotic systems: A sliding-mode synthesis via chaotic optimization
• An exact approach to early/tardy scheduling with release dates
• Application of chaos in simulated annealing
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• 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
• Improved particle swarm optimization combined with chaos
• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• The Complexity of Flowshop and Jobshop Scheduling
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem