A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
type: Item
instance of: scholarly article
title: A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
zbMATH Open document ID: 1264.90095
DOI: 10.1155/2012/478981
author: Jian Xiong
author: Xu Tan
author: Ke-Wei Yang
author: Lining Xing
author: Yingwu Chen
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: We address multiobjective flexible job-shop scheduling problem (FJSP) with three simultaneously considered objectives: minimizing makespan, minimizing total workload, and minimizing maximal workload. A hybrid multiobjective evolutionary approach (H-MOEA) is developed to solve the problem. According to the characteristic of FJSP, a modified crowding distance measure is introduced to maintain the diversity of individuals. In the proposed H-MOEA, well-designed chromosome representation and genetic operators are developed for FJSP. Moreover, a local search procedure based on critical path theory is incorporated in H-MOEA to improve the convergence ability of the algorithm. Experiment results on several well-known benchmark instances demonstrate the efficiency and stability of the proposed algorithm. The comparison with other recently published approaches validates that H-MOEA can obtain Pareto-optimal solutions with better quality and/or diversity.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6173316
Wikidata QID: Q58911756
describes a project that uses: Omni-optimizer
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/478981
OpenAlex ID: W2024954648
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Job-shop scheduling with multi-purpose machines
cites work: Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
cites work: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization
cites work: A genetic algorithm for the flexible job-shop scheduling problem
cites work: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update
cites work: A hybrid multiobjective genetic algorithm for robust resource-constrained project scheduling with stochastic durations
cites work: Q4248938
cites work: A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty
cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
description: scientific article; zbMATH DE number 6173316