A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

DOI10.1016/j.cor.2008.10.008zbMath1157.90423OpenAlexW1987790292WikidataQ115460922 ScholiaQ115460922MaRDI QIDQ1010312

Ling Wang, Bin Qian, Quan-ke Pan

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.10.008

zbMATH Keywords

differential evolutionmulti-objectivediscrete differential evolution algorithmspeed-upinsert neighborhoodno-wait flow shop

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (19)

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization ⋮ A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance ⋮ Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA ⋮ Predictive-reactive scheduling for single surgical suite subject to random emergency surgery ⋮ Estimating the parameters of 3-p Weibull distribution through differential evolution ⋮ Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm ⋮ Maintenance scheduling problem with fuzzy random time windows on a single machine ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ A differential evolution algorithm with self-adapting strategy and control parameters ⋮ Bi-objective ant colony optimization approach to optimize production and maintenance scheduling ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan ⋮ A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce ⋮ Dynamic virtual cellular reconfiguration for capacity planning of market-oriented production systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling flow shops using differential evolution algorithm
• A review of metrics on permutations for search landscape analysis
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
• A genetic algorithm for flowshop sequencing
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• New heuristics for no-wait flowshops to minimize makespan.
• Approximative procedures for no-wait job shop scheduling.
• Sequencing of jobs in some production system
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Solving multi-objective production scheduling problems using metaheuristics
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Genetic local search for multi-objective flowshop scheduling problems
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• Heuristic algorithms for continuous flow-shop problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Solutions to the Constrained Flowshop Sequencing Problem
• Ordonnancements à contraintes disjonctives
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems