Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound

DOI10.1007/s10288-011-0168-6zbMath1235.90099OpenAlexW2160512382MaRDI QIDQ766253

Lucio Bianco, Massimiliano Caramia

Publication date: 23 March 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/http://hdl.handle.net/2108/818

zbMATH Keywords

Lagrangian relaxationlower boundRCPSPfeeding precedence relations

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities ⋮ A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm ⋮ An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem

Cites Work

• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Project scheduling. A research handbook.
• Project scheduling with time windows. From theory to applications.
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Unnamed Item

This page was built for publication: Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound