Minimization of project-network with given bounds of activity durations.

MaRDI QIDQ4789917zbMATH OpenFDO

Authors A. N. Shilak, Yuriĭ Nazarovich Sotskov

Publication date 2001

zbMATH Keywords

project managementproject-network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35)

Recommendations

• New bounds and approximations for the probability distribution of the length of the critical path
• scientific article; zbMATH DE number 3976755
• Criticality analysis of activity networks under interval uncertainty
• Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
• On the latest starting times and criticality of activities in a network with imprecise durations

Cited in

(5)

• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• A note on minimum-dummy-activities PERT networks
• Fast minimum float computation in activity networks under interval uncertainty
• Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
• New bounds and approximations for the probability distribution of the length of the critical path

This page was built for publication: Minimization of project-network with given bounds of activity durations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789917)