A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
Summary: A novel multiobjective memetic algorithm based on decomposition (MOMAD) is proposed to solve multiobjective flexible job shop scheduling problem (MOFJSP), which simultaneously minimizes makespan, total workload, and critical workload. Firstly, a population is initialized by employing an integration of different machine assignment and operation sequencing strategies. Secondly, multiobjective memetic algorithm based on decomposition is presented by introducing a local search to MOEA/D. The Tchebycheff approach of MOEA/D converts the three-objective optimization problem to several single-objective optimization subproblems, and the weight vectors are grouped by \textit{K}-means clustering. Some good individuals corresponding to different weight vectors are selected by the tournament mechanism of a local search. In the experiments, the influence of three different aggregation functions is first studied. Moreover, the effect of the proposed local search is investigated. Finally, MOMAD is compared with eight state-of-the-art algorithms on a series of well-known benchmark instances and the experimental results show that the proposed algorithm outperforms or at least has comparative performance to the other algorithms.
- Multi-objective fuzzy flexible job shop scheduling using memetic algorithm
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- A multi-objective memetic algorithm for the job-shop scheduling problem
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- Effective neighbourhood functions for the flexible job shop problem
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Routing and scheduling in a flexible job shop by tabu search
- Statistical comparisons of classifiers over multiple data sets
- The Complexity of Flowshop and Jobshop Scheduling
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- A multi-objective memetic algorithm for the job-shop scheduling problem
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
- Approximate dominance NSGA-III algorithm for solving flexible job-shop scheduling problem
- Multi-objective fuzzy flexible job shop scheduling using memetic algorithm
- Novel imperialist competitive algorithm for many-objective flexible job shop scheduling
- An improved MOEA/D for multi-objective flexible job shop scheduling by considering efficiency and cost
- Flexible job-shop scheduling with limited flexible workers using an improved multiobjective discrete teaching-learning based optimization algorithm
This page was built for publication: A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992548)
