Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
From MaRDI portal
Publication:2883566
DOI10.1016/j.endm.2010.05.025zbMath1237.90081OpenAlexW2082383217MaRDI QIDQ2883566
Christian Artigues, Maria Ayala, Bernat Gacias
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.025
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
This page was built for publication: Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling