An effective differential evolution algorithm for permutation flow shop scheduling problem
From MaRDI portal
Publication:298425
DOI10.1016/j.amc.2014.09.010zbMath1338.90174OpenAlexW2029972294MaRDI QIDQ298425
Minghao Yin, Ying Liu, Wen-Xiang Gu
Publication date: 20 June 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.09.010
schedulingswarm intelligencedifferential evolutiongreedy-based local searchindividual improving schemepermutation flow shop problem
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Shop scheduling in manufacturing environments: a review ⋮ An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops
Cites Work
- Unnamed Item
- Supply chain management and advanced planning -- basics, overview and challenges
- Scheduling flow shops using differential evolution algorithm
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- The two-machine total completion time flow shop problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A new heuristic for the n-job, M-machine flow-shop problem
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- Optimal two- and three-stage production schedules with setup times included
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- On general routing problems
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
