Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
type: Item
instance of: scholarly article
title: Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
zbMATH Open document ID: 1458.90381
author: Keyi Xing
author: Guanghui Zhang
published in: Computers \& Operations Research
publication date: 2019-07-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7077515
zbMATH Keywords: distributed flowshop scheduling
zbMATH Keywords: makespan minimization
zbMATH Keywords: limited buffers
zbMATH Keywords: differential evolution metaheuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2019.04.002
OpenAlex ID: W2930178078
cites work: Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
cites work: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
cites work: 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
cites work: Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Flowshop sequencing problems with limited buffer storage
cites work: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
cites work: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
cites work: The distributed permutation flowshop scheduling problem
cites work: A scatter search algorithm for the distributed permutation flowshop scheduling problem
cites work: The permutation flow shop with buffers: A tabu search approach
cites work: Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
cites work: An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A two-machine permutation flow shop scheduling problem with buffers
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Benchmarks for basic scheduling problems
cites work: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
cites work: A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
cites work: Minimizing the total completion time in a distributed two stage assembly system with setup times
DOI: 10.1016/J.COR.2019.04.002
description: scientific article; zbMATH DE number 7077515