Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect

DOI10.1051/RO/2020009zbMath1437.90078OpenAlexW3003431028MaRDI QIDQ5109790

Mahdi Jemmali, Lotfi Hidri

Publication date: 13 May 2020

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2020009

zbMATH Keywords

heuristicsparallel machineslower boundslearning effect

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect