An improved particle swarm optimization algorithm for flowshop scheduling problem
From MaRDI portal
Publication:975447
DOI10.1016/J.IPL.2008.05.010zbMATH Open1191.68112OpenAlexW1988977820MaRDI QIDQ975447FDOQ975447
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
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
- Title not available (Why is that?)
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Improved particle swarm optimization combined with chaos
- The Complexity of Flowshop and Jobshop Scheduling
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- Some efficient heuristic methods for the flow shop sequencing problem
- A language and a program for stating and solving combinatorial problems
- Application of chaos in simulated annealing
- A new constructive heuristic for the flowshop scheduling problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- On robust control of uncertain chaotic systems: A sliding-mode synthesis via chaotic optimization
- A new heuristic method for the flow shop sequencing problem
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- New heuristics for no-wait flowshops to minimize makespan.
- An exact approach to early/tardy scheduling with release dates
- Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
Cited In (14)
- 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
- Title not available (Why is that?)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
- Reducing network and computation complexities in neural based real-time scheduling scheme
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
- A multi-objective particle swarm for a flow shop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem
- Title not available (Why is that?)
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)
