A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time

DOI10.1002/net.20388zbMath1202.90123MaRDI QIDQ3064043

Massimiliano Caramia, Lucio Bianco

Publication date: 20 December 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20388

zbMATH Keywords

project scheduling; time lags; acyclic networks

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research

90C39: Dynamic programming

Related Items

An effective approach for scheduling coupled activities in development projects, An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations, A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations, Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound, Simplifying activity networks under generalized precedence relations to extended CPM networks

Cites Work

• Unnamed Item
• Scheduling of project networks
• Project scheduling with time windows. From theory to applications.
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality