Pages that link to "Item:Q4903793"
From MaRDI portal
The following pages link to Application of a Technique for Research and Development Program Evaluation (Q4903793):
Displaying 50 items.
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
- Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project (Q322744) (← links)
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (Q337299) (← links)
- A new probabilistic approach to the path criticality in stochastic PERT (Q441034) (← links)
- Computing the moments of order statistics from independent nonidentically distributed beta random variables (Q451395) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Multi-mode resource-constrained project scheduling problem with material ordering under bonus-penalty policies (Q526633) (← links)
- Revisiting the PERT mean and variance (Q531483) (← links)
- Stochastic networks and the extreme value distribution (Q584063) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- Predetermined intervals for start times of activities in the stochastic project scheduling problem (Q646669) (← links)
- Additive factors and stages of mental processes in task networks (Q708636) (← links)
- A path enumeration approach for the analysis of critical activities in fuzzy networks (Q713412) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- Project bidding under deterministic and probabilistic activity durations (Q721677) (← links)
- A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept (Q852940) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- On the latest starting times and criticality of activities in a network with imprecise durations (Q988966) (← links)
- A minmax regret approach to the critical path method with task interval times (Q1011286) (← links)
- Evaluating project completion time in project networks with discrete random activity durations (Q1017440) (← links)
- Maximizing the net present value of a project under uncertainty (Q1039778) (← links)
- Scheduling projects with stochastic activity duration to maximize expected net present value (Q1042042) (← links)
- Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026) (← links)
- Computing latest starting times of activities in interval-valued networks with minimal time lags (Q1044116) (← links)
- An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network (Q1124724) (← links)
- A proposal on improved procedures for estimating task-time distributions in PERT (Q1127234) (← links)
- The use of fuzzy variables in PERT (Q1148224) (← links)
- Constructing a stochastic critical path network given the slacks: Representation (Q1196917) (← links)
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations (Q1265850) (← links)
- DAGEN: A generator of testsets for project activity nets (Q1266552) (← links)
- Estimating the demand distributions of single-period items having frequent stockouts (Q1268257) (← links)
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (Q1303751) (← links)
- The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
- Sample-path optimization of convex stochastic performance functions (Q1363424) (← links)
- Least possible time paths in stochastic, time-varying networks. (Q1406727) (← links)
- On criticality and sensitivity in activity networks (Q1590027) (← links)
- Improving project cost estimation by taking into account managerial flexibility (Q1590029) (← links)
- Some analytic features of algebraic data (Q1613427) (← links)
- New strategies for stochastic resource-constrained project scheduling (Q1617288) (← links)
- Computing project makespan distributions: Markovian PERT networks revisited (Q1634063) (← links)
- Fuzzy-probabilistic PERT (Q1686504) (← links)
- How to apply penalties to avoid delays in projects (Q1713753) (← links)
- How adding new information modifies the estimation of the mean and the variance in PERT: a maximum entropy distribution approach (Q1730716) (← links)
- Moments and distribution of the net present value of a serial project (Q1754257) (← links)
- New model and heuristics for safety stock placement in general acyclic supply chain networks (Q1762120) (← links)
- On the fallacy of averages in project risk management (Q1772835) (← links)
- Stochastic and fuzzy PERT (Q1823843) (← links)
