A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

DOI10.1016/S0377-2217(97)00305-6zbMath0948.90077OpenAlexW2132709136WikidataQ126351477 ScholiaQ126351477MaRDI QIDQ1303751

De Reyck, Bert, Willy S. Herroelen

Publication date: 27 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00305-6

zbMATH Keywords

branch-and-boundproject managementgeneralized precedence relationscritical path methods

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items

A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem, An effective approach for scheduling coupled activities in development projects, Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations, A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints, A polyhedral study of event-based models for the resource-constrained project scheduling problem, Project scheduling with finite or infinite number of activity processing modes -- a survey, Lower bounds for resource-constrained project scheduling problems., A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints, An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources, Solving RCPSP/max by lazy clause generation, Tropical optimization problems in time-constrained project scheduling, An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations, Dismantling of nuclear power plants at optimal NPV, A min-flow algorithm for minimal critical set detection in resource constrained project scheduling, An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags, Considering project management activities for engineering design groups, SCHEDULING THE HARVESTING OPERATIONS OF A FOREST BLOCK: A CASE STUDY, Revenue sharing for resource reallocation among project activity contractors, A hybrid framework for over-constrained generalized resource-constrained project scheduling problems, A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations, Scheduling of continuous and discontinuous material flows with intermediate storage restrictions, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Revenue sharing for resource transfer among projects, A high-performance exact method for the resource-constrained project scheduling problem, Project selection, scheduling and resource allocation with time dependent returns, Resource-constrained project scheduling: Notation, classification, models, and methods, Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling, The multi-mode resource-constrained project scheduling problem with generalized precedence relations, An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations, Simplifying activity networks under generalized precedence relations to extended CPM networks, Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound, An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem, Scheduling contractors' farm‐to‐farm crop harvesting operations, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The scheduling of activities to maximize the net present value of projects
• Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• Project network models with discounted cash flows a guided tour through recent developments
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Heuristics for scheduling resource-constrained projects in MPM networks
• One-machine generalized precedence constrained scheduling problems
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• Application of a Technique for Research and Development Program Evaluation
• Cash Flows in Networks
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
• The payment scheduling problem
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems