An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion
From MaRDI portal
Publication:2627567
DOI10.1504/IJOR.2015.068287zbMath1362.90185OpenAlexW2070805628MaRDI QIDQ2627567
Publication date: 31 May 2017
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2015.068287
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
This page was built for publication: An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion