Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem
From MaRDI portal
Publication:1639843
DOI10.1007/s13369-013-0756-1zbMath1390.90597OpenAlexW2124204051MaRDI QIDQ1639843
Ching-Kao Chang, Jyh-Horng Chou, Ching-I Yang
Publication date: 13 June 2018
Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13369-013-0756-1
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
A study on integration of lot sizing and flow shop lot streaming problems ⋮ Maintenance scheduling problem with fuzzy random time windows on a single machine
Cites Work
- Unnamed Item
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A multi-objective particle swarm for a flow shop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- An orthogonal-array-based particle swarm optimizer with nonlinear time-varying evolution
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- Genetic algorithms for the two-stage bicriteria flowshop problem
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Genetic local search for multi-objective flowshop scheduling problems
- Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
This page was built for publication: Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem