Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
From MaRDI portal
Publication:2003413
DOI10.1016/J.COR.2019.04.002zbMath1458.90381OpenAlexW2930178078MaRDI QIDQ2003413
Publication date: 8 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.002
makespan minimizationlimited buffersdistributed flowshop schedulingdifferential evolution metaheuristics
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Improved DE search for competing groups scheduling with deterioration effects ⋮ Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups ⋮ Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem
Cites Work
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Minimizing the total completion time in a distributed two stage assembly system with setup times
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- The distributed permutation flowshop scheduling problem
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- A two-machine permutation flow shop scheduling problem with buffers
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- The permutation flow shop with buffers: A tabu search approach
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
- Benchmarks for basic scheduling problems
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Flowshop sequencing problems with limited buffer storage
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
