An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
Domains
Operations Research [math.OC]| Origin | Files produced by the author(s) |
|---|
Journal Articles
Computers and Operations Research
Year : 2019
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 : Tuesday, September 17, 2024-3:46:06 PM
Long-term archiving on : Monday, January 24, 2022-5:02:26 PM
Dates and versions
Licence
Identifiers
- HAL Id : emse-02333455 , version 1
- DOI : 10.1016/j.cor.2019.04.012
- PII : S0305-0548(19)30095-4
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⟩
Collections
140
View
157
Download