Fast minimum float computation in activity networks under interval uncertainty
From MaRDI portal
Recommendations
- Interval Analysis in Scheduling
- Criticality analysis of activity networks under interval uncertainty
- On computing the latest starting times and floats of activities in a network with imprecise durations
- Publication:4789917
- Solution of interval PERT/CPM network problems by a simplified tabular method
Cites work
- Criticality analysis of activity networks under interval uncertainty
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- On latest starting times and floats in activity networks with ill-known durations
- On the hardness of evaluating criticality of activities in a planar network with duration intervals
- Project scheduling under uncertainty: survey and research potentials
- Rangen: A random network generator for activity-on-the-node networks
- Robust discrete optimization and its applications
- Stochastic scheduling problems I — General strategies
- The computational complexity of the criticality problems in a network with interval activity times
- When it is worthwhile to work with the stochastic RCPSP?
Cited in
(5)- Interval Analysis in Scheduling
- On latest starting times and floats in activity networks with ill-known durations
- On computing the latest starting times and floats of activities in a network with imprecise durations
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- scientific article; zbMATH DE number 5670845 (Why is no real title available?)
This page was built for publication: Fast minimum float computation in activity networks under interval uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398844)