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

DOI10.1016/J.ENDM.2010.05.025MaRDI QIDQ2883566zbMATH OpenOpenAlexFDO

Authors Maria Ayala, Christian Artigues, 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 relaxationminimum periodmodulo schedulingresource constraints

Mathematics Subject Classification ID

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

Recommendations

• The resource-constrained modulo scheduling problem: an experimental study
• scientific article; zbMATH DE number 1405789
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
• Lower bounds for resource-constrained project scheduling problems.
• scientific article; zbMATH DE number 5132358

Cites work

• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Solving project scheduling problems by minimum cut computations

Cited in

(2)

• The resource-constrained modulo scheduling problem: an experimental study
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883566)