A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

DOI10.1287/OPRE.45.2.201zbMATH Open0890.90098OpenAlexW2032412651MaRDI QIDQ4367245FDOQ4367245

Erik Demeulemeester, Willy Herroelen

Publication date: 8 July 1998

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/500057

Recommendations

• 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 generalized precedence relations
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• scientific article; zbMATH DE number 1264426
• Resource-constrained project scheduling: A survey of recent developments.

zbMATH Keywords

branch-and-boundready timesdue-datesgeneralized resource-constrained project schedulingprecedence relations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (22)

• A branch-and-bound algorithm for RCPSP with variable resource requirements and variable multiple resource availability constraints
• Title not available (Why is that?)
• Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling
• A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply
• Considering project management activities for engineering design groups
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
• Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• Activity nets: A guided tour through some recent developments
• Resource-constrained project scheduling: A survey of recent developments.
• A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
• A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
• 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
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
• A review of the contribution of operational research to project management
• Reduction method based on a new fuzzy rough set in fuzzy information system and its applications to scheduling problems
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
• Project selection, scheduling and resource allocation with time dependent returns
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement

This page was built for publication: A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

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