An exact composite lower bound strategy for the resource-constrained project scheduling problem
From MaRDI portal
Publication:1652587
DOI10.1016/j.cor.2018.01.017zbMath1391.90250OpenAlexW2793889369MaRDI QIDQ1652587
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.017
Related Items (15)
A reduction tree approach for the discrete time/cost trade-off problem ⋮ An exact composite lower bound strategy for the resource-constrained project scheduling problem ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ Going to the core of hard resource-constrained project scheduling instances ⋮ An evolutionary approach for resource constrained project scheduling with uncertain changes ⋮ An analysis of network and resource indicators for resource-constrained project scheduling problem instances ⋮ New summary measures and datasets for the multi-project scheduling problem ⋮ New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem ⋮ A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms ⋮ Using schedule risk analysis with resource constraints for project control ⋮ A tree search heuristic for the resource constrained project scheduling problem with transfer times ⋮ A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Uses Software
Cites Work
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Scheduling subject to resource constraints: Classification and complexity
- PSPLIB -- a project scheduling problem library
- Resource-constrained project scheduling: A survey of recent developments.
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- The project scheduling problem with irregular starting time costs
- An evaluation of the adequacy of project network generators with systematically sampled networks
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- New representation to reduce the search space for the resource-constrained project scheduling problem
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A Horizon-Varying, Zero-One Approach to Project Scheduling
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Project scheduling with multiple modes: A comparison of exact algorithms
This page was built for publication: An exact composite lower bound strategy for the resource-constrained project scheduling problem
