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

DOI10.1016/J.EJOR.2011.12.019zbMATH Open1244.90088OpenAlexW2034760940MaRDI QIDQ439614FDOQ439614

Authors: Lucio Bianco, Massimiliano Caramia 

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

Recommendations

• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
• An exact algorithm for minimizing resource availability costs in project scheduling
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• scientific article; zbMATH DE number 2086192
• An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
• A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
• A preemptive bound for the resource constrained project scheduling problem
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

zbMATH Keywords

branch and boundgeneralized precedence relationshipsLagrangian relaxation

Mathematics Subject Classification ID

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

Cites Work

• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Project scheduling. A research handbook.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Solving project scheduling problems by minimum cut computations
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• 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
• Title not available (Why is that?)
• Project scheduling with time windows. From theory to applications.
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations

Cited In (15)

• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
• A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
• A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply
• On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
• Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
• An effective approach for scheduling coupled activities in development projects
• A min-flow algorithm for minimal critical set detection in resource constrained project scheduling
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
• A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
• PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
• Resource leveling in projects with flexible structures
• An updated survey of variants and extensions of the resource-constrained project scheduling problem

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

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