A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan

DOI10.1016/j.chaos.2006.05.082zbMath1146.90418OpenAlexW2076293397MaRDI QIDQ2470219

Zhigang Lian, Xingsheng Gu, Bin Jiao

Publication date: 13 February 2008

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2006.05.082

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ Chaos embedded particle swarm optimization algorithms ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA ⋮ Feature Selection and Recognition of Muzzle Point Image Pattern of Cattle by Using Hybrid Chaos BFO and PSO Algorithms ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm ⋮ An improved particle swarm optimization algorithm for flowshop scheduling problem ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan

Cites Work

• An improved GA and a novel PSO-GA-based hybrid algorithm
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• On robust control of uncertain chaotic systems: A sliding-mode synthesis via chaotic optimization
• Application of chaos in simulated annealing
• Improved particle swarm optimization combined with chaos
• A modification to particle swarm optimization algorithm

This page was built for publication: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan