On the summary measures for the resource-constrained project scheduling problem
From MaRDI portal
(Redirected from Publication:6581387)
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
- A decomposition theorem for partially ordered sets
- 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
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
- An evaluation of the adequacy of project network generators with systematically sampled networks
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Coefficient of Network Complexity
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Going to the core of hard resource-constrained project scheduling instances
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- Measures of the restrictiveness of project networks
- Measuring instance difficulty for combinatorial optimization problems
- Measuring time. Improving project performance using earned value management
- New summary measures and datasets for the multi-project scheduling problem
- On Dynamic Programming Methods for Assembly Line Balancing
- On maximizing the net present value of a project under renewable resource constraints
- On the measurement of complexity in activity networks
- On the use of the complexity index as a measure of complexity in activity networks
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Phase transitions in project scheduling
- Project scheduling: The effects of problem structure on heuristic performance
- PSPLIB -- a project scheduling problem library
- Rangen: A random network generator for activity-on-the-node networks
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- The risk of delay of a project in terms of the morphology of its network
Cited in
(4)- Reducing the feasible solution space of resource-constrained project instances
- Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Duration forecasting in resource constrained projects: a hybrid risk model combining complexity indicators with sensitivity measures
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)
