A high performing metaheuristic for multi-objective flowshop scheduling problem
From MaRDI portal
Publication:337199
DOI10.1016/j.cor.2014.01.006zbMath1348.90277OpenAlexW2001737911MaRDI QIDQ337199
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
multi-objective optimizationgenetic algorithmflowshop scheduling problemPareto archivevariable neighborhood search (VNS)
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- A multi-objective particle swarm for a flow shop scheduling problem
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
- Variable neighborhood search
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Genetic local search for multi-objective flowshop scheduling problems
- Flowshop scheduling research after five decades
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Variable neighborhood search: Principles and applications
- Minimizing tardiness in a two-machine flow-shop
- Data mining. Concepts and techniques
