A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
type: Item
instance of: scholarly article
title: A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
zbMATH Open document ID: 1426.90142
DOI: 10.1155/2017/2857564
author: Zhicheng Ji
author: Yan Wang
author: C. Wang
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6971915
describes a project that uses: MOEA/D
describes a project that uses: HypE
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/2857564
OpenAlex ID: W2771484548
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Effective neighbourhood functions for the flexible job shop problem
cites work: An integrated search heuristic for large-scale flexible job shop scheduling problems
cites work: A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets
cites work: Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
cites work: A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
cites work: Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
cites work: Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization
cites work: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
cites work: A genetic algorithm for the flexible job-shop scheduling problem
cites work: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: Q3093335
cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
description: scientific article; zbMATH DE number 6971915