An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
type: Item
instance of: scholarly article
title: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
zbMATH Open document ID: 1458.90294
author: Andrés Alberto García-León
author: Stèphane Dauzère-Pérès
author: Yazid Mati
published in: Computers \& Operations Research
publication date: 2019-07-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7077527
zbMATH Keywords: flexible job-shop scheduling
zbMATH Keywords: multi-objective
zbMATH Keywords: regular criteria
zbMATH Keywords: Pareto optimization
zbMATH Keywords: local search
describes a project that uses: weightedHypervolume
MaRDI profile type: Publication
full work available at URL: j.cor.2019.04.012
OpenAlex ID: W2938448575
cites work: A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: A research survey: review of flexible job shop scheduling techniques
cites work: A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
cites work: Multi-resource shop scheduling with resource flexibility
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Scatter search with path relinking for the flexible job shop scheduling problem
cites work: Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
cites work: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem
cites work: A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
cites work: A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
cites work: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
Wikidata QID: Q128076005
DOI: 10.1016/J.COR.2019.04.012
description: scientific article; zbMATH DE number 7077527