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 revistaArtí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ónEnfoque eficiente de Paretiano para solucionar el problema de scheduling Job-shop flexible Multi objetivo con crieterios regulares
Idioma originalInglés
Páginas (desde-hasta)187-200
Número de páginas14
PublicaciónComputers and Operations Research
Volumen108
DOI
EstadoPublicada - 1 ago 2019

Palabras clave

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

Citar esto