Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling

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

zbMATH Keywords

Lagrangian relaxationresource constraintsmodulo schedulingminimum period

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

The resource-constrained modulo scheduling problem: an experimental study

Cites Work

• Unnamed Item
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Solving Project Scheduling Problems by Minimum Cut Computations

This page was built for publication: Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling