An improved particle swarm optimization algorithm for flowshop scheduling problem

DOI10.1016/J.IPL.2008.05.010MaRDI QIDQ975447zbMATH OpenOpenAlexFDO

Authors Changsheng Zhang, Jigui Sun, Xingjun Zhu, Qingyun Yang

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

particle swarm optimizationmakespancombinatorial problemsflow shop scheduling problem

Mathematics Subject Classification ID

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

Recommendations

• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• Job-shop scheduling based on improved particle swarm
• A discrete version of particle swarm optimization for flowshop scheduling problems
• A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
• A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• A language and a program for stating and solving combinatorial problems
• A new constructive heuristic for the flowshop scheduling problem
• A new heuristic method for the flow shop sequencing problem
• A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• An exact approach to early/tardy scheduling with release dates
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Application of chaos in simulated annealing
• Improved particle swarm optimization combined with chaos
• New heuristics for no-wait flowshops to minimize makespan.
• On robust control of uncertain chaotic systems: A sliding-mode synthesis via chaotic optimization
• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• Some efficient heuristic methods for the flow shop sequencing problem
• The Complexity of Flowshop and Jobshop Scheduling
• The particle swarm optimization algorithm: Convergence analysis and parameter selection

Cited in

(16)

• Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem
• Reducing network and computation complexities in neural based real-time scheduling scheme
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Genetic based discrete particle swarm optimization for elderly day care center timetabling
• A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem
• Optimizing version release dates of research and development long-term processes
• An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Solving technician routing and scheduling problem using improved particle swarm optimization
• scientific article; zbMATH DE number 5583273 (Why is no real title available?)
• A multi-objective particle swarm for a flow shop scheduling problem
• scientific article; zbMATH DE number 6453728 (Why is no real title available?)
• A discrete version of particle swarm optimization for flowshop scheduling problems
• A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
• Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan

This page was built for publication: An improved particle swarm optimization algorithm for flowshop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975447)