An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria - Mines Saint-Étienne Access content directly
Journal Articles Computers and Operations Research Year : 2019

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

Domains

Operations Research [cs.RO]
Fichier principal
Vignette du fichier
S0305054819300954.pdf (749.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Accord Elsevier CCSD  : Connect in order to contact the contributor

https://hal-emse.ccsd.cnrs.fr/emse-02333455

Submitted on : Friday, October 22, 2021-7:30:10 PM

Last modification on : Wednesday, October 25, 2023-3:22:03 PM

Long-term archiving on: Monday, January 24, 2022-5:02:26 PM

Download

Dates and versions

emse-02333455 , version 1 (22-10-2021)

Licence

Attribution - NonCommercial

Identifiers

Elsevier-hosted Accepted Manuscript

Cite

Andrés Alberto García-León, Stéphane Dauzere-Peres, Yazid Mati. An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Computers and Operations Research, 2019, 108, pp.187-200. ⟨10.1016/j.cor.2019.04.012⟩. ⟨emse-02333455⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EMSE INSTITUT-TELECOM PRES_CLERMONT CNRS SFL-ENSMSE LIMOS CLERMONT-AUVERGNE-INP
60 View
96 Download

Altmetric

Share

Gmail Facebook X LinkedIn More