A high performing metaheuristic for multi-objective flowshop scheduling problem

DOI10.1016/J.COR.2014.01.006MaRDI QIDQ337199zbMATH OpenOpenAlexFDO

Authors N. Karimi, H. Davoudpour

Publication date 10 November 2016

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

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

zbMATH Keywords

genetic algorithmmulti-objective optimizationflowshop scheduling problemPareto archivevariable neighborhood search (VNS)

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A genetic algorithm for flowshop scheduling with multiple objectives
• Genetic local search for multi-objective flowshop scheduling problems
• Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
• scientific article; zbMATH DE number 6746310
• An improved genetic algorithm for the flowshop scheduling problem

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 837310 (Why is no real title available?)
• A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
• A multi-objective particle swarm for a flow shop scheduling problem
• A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Data mining. Concepts and techniques
• Flowshop scheduling research after five decades
• Genetic local search for multi-objective flowshop scheduling problems
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Minimizing tardiness in a two-machine flow-shop
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(6)

• Genetic local search for multi-objective flowshop scheduling problems
• A genetic algorithm for flowshop scheduling with multiple objectives
• A knowledge-based approach for multi-factory production systems
• Multi-objective flow shop scheduling problem based on GMOGSO
• Multi-objective flow-shop scheduling problem based on MOEA/D algorithm with \(g\)-dominating strategy
• Multiobjective scheduling by genetic algorithms.

This page was built for publication: A high performing metaheuristic for multi-objective flowshop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337199)