Providing lower bounds for the multi-mode resource-constrained project scheduling problem

DOI10.1007/978-3-319-55702-1_73MaRDI QIDQ4596507zbMATH OpenOpenAlexFDO

Authors Christian Stürck, Patrick Gerhards

Publication date 1 December 2017

Published in Operations Research Proceedings 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55702-1_73

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Lower bounds for resource-constrained project scheduling problems.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• On linear lower bounds for the resource constrained project scheduling problem.
• scientific article; zbMATH DE number 5132358
• Lower bounds for a multi-skill project scheduling problem

Cited in

(6)

• An exact composite lower bound strategy for the resource-constrained project scheduling problem
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• An integer programming approach to the multimode resource-constrained multiproject scheduling problem
• scientific article; zbMATH DE number 5132358 (Why is no real title available?)
• Lower bounds for a multi-skill project scheduling problem

This page was built for publication: Providing lower bounds for the multi-mode resource-constrained project scheduling problem

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