A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations

DOI10.1016/j.cor.2009.07.003zbMath1231.90177OpenAlexW2042604367MaRDI QIDQ709101

Massimiliano Caramia, Lucio Bianco

Publication date: 15 October 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

project schedulinglower boundgeneralized precedence relationships

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ 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 ⋮ A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations ⋮ Approximability results for the resource-constrained project scheduling problem with a single type of resources ⋮ Simplifying activity networks under generalized precedence relations to extended CPM networks

Cites Work

• Unnamed Item
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• Scheduling subject to resource constraints: Classification and complexity
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Project scheduling. A research handbook.
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Project scheduling with time windows. From theory to applications.
• 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)
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem

This page was built for publication: A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations