A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
From MaRDI portal
Publication:4367245
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.
Cited in
(26)- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- A branch-and-bound algorithm for RCPSP with variable resource requirements and variable multiple resource availability constraints
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
- scientific article; zbMATH DE number 370525 (Why is no real title available?)
- A review of the contribution of operational research to project management
- Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- Considering project management activities for engineering design groups
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem
- 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 partially renewable resources and general temporal constraints
- Activity nets: A guided tour through some recent developments
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
- Scheduling resource-constrained projects competitively at modest memory requirements
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- Project selection, scheduling and resource allocation with time dependent returns
- A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply
- Resource-constrained project scheduling: A survey of recent developments.
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)
