A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
type: Item
instance of: scholarly article
title: A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
zbMATH Open document ID: 1157.90423
author: Ling Wang
author: Bin Qian
author: Quanke Pan
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 5539886
zbMATH Keywords: differential evolution
zbMATH Keywords: discrete differential evolution algorithm
zbMATH Keywords: no-wait flow shop
zbMATH Keywords: multi-objective
zbMATH Keywords: insert neighborhood
zbMATH Keywords: speed-up
MaRDI profile type: Publication
full work available at URL: j.cor.2008.10.008
OpenAlex ID: W1987790292
Wikidata QID: Q115460922
cites work: An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
cites work: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Sequencing of jobs in some production system
cites work: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
cites work: Solutions to the Constrained Flowshop Sequencing Problem
cites work: Heuristic algorithms for continuous flow-shop problem
cites work: New heuristics for no-wait flowshops to minimize makespan.
cites work: Solving the continuous flow-shop scheduling problem by metaheuristics.
cites work: Approximative procedures for no-wait job shop scheduling.
cites work: Some local search algorithms for no-wait flow-shop problem with makespan criterion
cites work: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
cites work: Q3970631
cites work: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
cites work: Solving multi-objective production scheduling problems using metaheuristics
cites work: Genetic local search for multi-objective flowshop scheduling problems
cites work: A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
cites work: No-wait flowshops with bicriteria of makespan and maximum lateness.
cites work: A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
cites work: Q3425494
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Scheduling flow shops using differential evolution algorithm
cites work: Q5437767
cites work: A review of metrics on permutations for search landscape analysis
cites work: Q4817405
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Ordonnancements à contraintes disjonctives
cites work: A genetic algorithm for flowshop sequencing
cites work: Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
DOI: 10.1016/J.COR.2008.10.008
description: scientific article; zbMATH DE number 5539886