On the summary measures for the resource-constrained project scheduling problem
From MaRDI portal
Publication:6581387
DOI10.1007/S10479-023-05470-8zbMATH Open1544.90088MaRDI QIDQ6581387FDOQ6581387
Authors: Rob Van Eynde, Mario Vanhoucke, José Coelho 
Publication date: 30 July 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
- New summary measures and datasets for the multi-project scheduling problem
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
Cites Work
- PSPLIB -- a project scheduling problem library
- On the measurement of complexity in activity networks
- Measures of the restrictiveness of project networks
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Measuring time. Improving project performance using earned value management
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- An evaluation of the adequacy of project network generators with systematically sampled networks
- Rangen: A random network generator for activity-on-the-node networks
- On maximizing the net present value of a project under renewable resource constraints
- Phase transitions in project scheduling
- On the use of the complexity index as a measure of complexity in activity networks
- Measuring instance difficulty for combinatorial optimization problems
- A decomposition theorem for partially ordered sets
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
- On Dynamic Programming Methods for Assembly Line Balancing
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Project scheduling: The effects of problem structure on heuristic performance
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Coefficient of Network Complexity
- The risk of delay of a project in terms of the morphology of its network
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- Going to the core of hard resource-constrained project scheduling instances
- A reduction tree approach for the discrete time/cost trade-off problem
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
- 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
Cited In (1)
This page was built for publication: On the summary measures for the resource-constrained project scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581387)
