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

DOI10.1016/J.COR.2009.07.003zbMATH Open1231.90177OpenAlexW2042604367MaRDI QIDQ709101FDOQ709101

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

lower boundgeneralized precedence relationshipsproject scheduling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Scheduling subject to resource constraints: Classification and complexity
• Project scheduling. A research handbook.
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• 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
• 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 (11)

• Approximability results for the resource-constrained project scheduling problem with a single type of resources
• Title not available (Why is that?)
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
• Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• An exact composite lower bound strategy for the resource-constrained project scheduling problem
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Simplifying activity networks under generalized precedence relations to extended CPM networks
• A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
• An updated survey of variants and extensions of 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

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