Resource-constrained project scheduling: A survey of recent developments.
DOI10.1016/S0305-0548(97)00055-5zbMath1040.90525OpenAlexW1969848548MaRDI QIDQ1406618
De Reyck, Bert, Willy S. Herroelen, Erik L. Demeulemeester
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00055-5
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The scheduling of activities to maximize the net present value of projects
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- A decomposition approach to multi-project scheduling
- Scheduling of project networks
- Scheduling subject to resource constraints: Classification and complexity
- On the measurement of complexity in activity networks
- Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
- A multiple-tree search procedure for the resource-constrained project scheduling problem
- Project network models with discounted cash flows a guided tour through recent developments
- On the use of the complexity index as a measure of complexity in activity networks
- A note on ``Hierarchical models for multi-project planning and scheduling
- PSPLIB -- a project scheduling problem library
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- Resource-constrained project scheduling. Exact methods for the multi-mode case
- Heuristics for scheduling resource-constrained projects in MPM networks
- On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem
- One-machine generalized precedence constrained scheduling problems
- An exact algorithm for project scheduling with multiple modes
- Activity nets: A guided tour through some recent developments
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Solving the resource constrained project scheduling problem with optimization subroutine library
- Scheduling a project to maximize its net present value: An integer programming approach
- Hierarchical models for multi-project planning and scheduling
- Sequencing theory
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Phase transitions in project scheduling
- New computational results on the discrete time/cost trade-off problem in project networks
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- On Dynamic Programming Methods for Assembly Line Balancing
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A Horizon-Varying, Zero-One Approach to Project Scheduling
- Project scheduling: The effects of problem structure on heuristic performance
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- On general routing problems
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Scheduling research in multiple resource constrained job shops: a review and critique
- Local search methods for the discrete time/resource trade-off problem in project networks
- 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
- Solving resource-constrained project scheduling problems by a* search
- The Schedule-Sequencing Problem
- Cash Flows in Networks
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
- An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
- Resource-constrained Project Scheduling — The State of the Art
- The payment scheduling problem
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
This page was built for publication: Resource-constrained project scheduling: A survey of recent developments.