The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
From MaRDI portal
Recommendations
- Simplifying activity networks under generalized precedence relations to extended CPM networks
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities
- Critical path in an activity network with time constraints
- Recent Developments In Stochastic Activity Networks
- Scheduling of project networks
Cited in
(36)- Maximizing the net present value of a project under uncertainty
- Simulated annealing and tabu search for multi-mode project payment scheduling
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- Critical path in an activity network with time constraints
- Audit scheduling with overlapping activities and sequence-dependent setup costs
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
- Activity nets: A guided tour through some recent developments
- Resource-constrained project scheduling: A survey of recent developments.
- Improving project cost estimation by taking into account managerial flexibility
- Simplifying the nonlinear continuous time-cost tradeoff problem
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities
- On the complexity of project scheduling to minimize exposed time
- Simplifying activity networks under generalized precedence relations to extended CPM networks
- Theory and application of reciprocal transformation of “path problem” and “time float problem”
- A float-path theory and its application to the time-cost tradeoff problem
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
- A branch-and-bound algorithm for scheduling of new product development projects
- Work package sizing and project performance
- A new approach for solving the network problems
- Critical activity analysis in precedence diagram method scheduling network
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- A path enumeration approach for the analysis of critical activities in fuzzy networks
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- On no-wait and no-idle flow shops with makespan criterion
- A problem of finding an acceptable variant in generalized project networks
This page was built for publication: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015267)
