An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria

Andrés Alberto García León; Stéphane  Dauzère-Pérès; Yazid Mati

doi:https://doi.org/10.1016/j.cor.2019.04.012

An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria

Título traducido de la contribución: Enfoque eficiente de Paretiano para solucionar el problema de scheduling Job-shop flexible Multi objetivo con crieterios regulares

Andrés Alberto García León, Stéphane Dauzère-Pérès, Yazid Mati

Resultado de la investigación: Contribución a una revista › Artículo

3 Citas (Scopus)

Resumen

In this paper, a general local search approach for the Multi-Objective Flexible Job-shop Scheduling Problem (MOFJSP) is proposed to determine a Pareto front for any combination of regular criteria. The approach is based on a disjunctive graph, a fast estimation function to evaluate moves and a hierarchical test to efficiently control the set of non-dominated solutions. Four search strategies using two neighborhood structures are developed. Numerical experiments are conducted on test instances of the literature with three sets of criteria to minimize and using metrics to evaluate and compare Pareto fronts. The results show that our approach provides sets of non-dominated solutions of good quality.

Título traducido de la contribución	Enfoque eficiente de Paretiano para solucionar el problema de scheduling Job-shop flexible Multi objetivo con crieterios regulares
Idioma original	Inglés
Páginas (desde-hasta)	187-200
Número de páginas	14
Publicación	Computers and Operations Research
Volumen	108
DOI	https://doi.org/10.1016/j.cor.2019.04.012
Estado	Publicada - 1 ago 2019

Palabras clave

Flexible job-shop scheduling
Multi-objective
Regular criteria
Pareto optimization
Local search

Acceder al documento

https://doi.org/10.1016/j.cor.2019.04.012Licencia: Sin especificar

Citar esto

García León, A. A., Dauzère-Pérès, S., & Mati, Y. (2019). An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Computers and Operations Research, 108, 187-200. https://doi.org/10.1016/j.cor.2019.04.012

@article{66c4652893664949a2b5b25c0858fe23,

title = "An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria",

abstract = "In this paper, a general local search approach for the Multi-Objective Flexible Job-shop Scheduling Problem (MOFJSP) is proposed to determine a Pareto front for any combination of regular criteria. The approach is based on a disjunctive graph, a fast estimation function to evaluate moves and a hierarchical test to efficiently control the set of non-dominated solutions. Four search strategies using two neighborhood structures are developed. Numerical experiments are conducted on test instances of the literature with three sets of criteria to minimize and using metrics to evaluate and compare Pareto fronts. The results show that our approach provides sets of non-dominated solutions of good quality.",

keywords = "Flexible job-shop scheduling, Multi-objective, Regular criteria, Pareto optimization, Local search",

author = "{Garc{\'i}a Le{\'o}n}, {Andr{\'e}s Alberto} and St{\'e}phane Dauz{\`e}re-P{\'e}r{\`e}s and Yazid Mati",

year = "2019",

month = aug,

day = "1",

doi = "https://doi.org/10.1016/j.cor.2019.04.012",

language = "Ingl{\'e}s",

volume = "108",

pages = "187--200",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria

AU - García León, Andrés Alberto

AU - Dauzère-Pérès, Stéphane

AU - Mati, Yazid

PY - 2019/8/1

Y1 - 2019/8/1

N2 - In this paper, a general local search approach for the Multi-Objective Flexible Job-shop Scheduling Problem (MOFJSP) is proposed to determine a Pareto front for any combination of regular criteria. The approach is based on a disjunctive graph, a fast estimation function to evaluate moves and a hierarchical test to efficiently control the set of non-dominated solutions. Four search strategies using two neighborhood structures are developed. Numerical experiments are conducted on test instances of the literature with three sets of criteria to minimize and using metrics to evaluate and compare Pareto fronts. The results show that our approach provides sets of non-dominated solutions of good quality.

AB - In this paper, a general local search approach for the Multi-Objective Flexible Job-shop Scheduling Problem (MOFJSP) is proposed to determine a Pareto front for any combination of regular criteria. The approach is based on a disjunctive graph, a fast estimation function to evaluate moves and a hierarchical test to efficiently control the set of non-dominated solutions. Four search strategies using two neighborhood structures are developed. Numerical experiments are conducted on test instances of the literature with three sets of criteria to minimize and using metrics to evaluate and compare Pareto fronts. The results show that our approach provides sets of non-dominated solutions of good quality.

KW - Flexible job-shop scheduling

KW - Multi-objective

KW - Regular criteria

KW - Pareto optimization

KW - Local search

U2 - https://doi.org/10.1016/j.cor.2019.04.012

DO - https://doi.org/10.1016/j.cor.2019.04.012

M3 - Artículo

VL - 108

SP - 187

EP - 200

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -