An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations

DOI10.1016/j.ejor.2011.12.019zbMath1244.90088OpenAlexW2034760940MaRDI QIDQ439614

Massimiliano Caramia, Lucio Bianco

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.019

zbMATH Keywords

Lagrangian relaxationbranch and boundgeneralized precedence relationships

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (7)

Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities ⋮ An effective approach for scheduling coupled activities in development projects ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ Resource leveling in projects with flexible structures ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Solving Project Scheduling Problems by Minimum Cut Computations
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations