A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
From MaRDI portal
Publication:1992548
DOI10.1155/2017/2857564zbMath1426.90142OpenAlexW2771484548MaRDI QIDQ1992548
Yan Wang, Zhicheng Ji, Chun Wang
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/2857564
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times, A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem, An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
Uses Software
Cites Work
- Unnamed Item
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization
- A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- A genetic algorithm for the flexible job-shop scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
