Finding the critical path in an activity network with time-switch constraints

DOI10.1016/S0377-2217(98)00390-7zbMath0962.90006OpenAlexW2025005527MaRDI QIDQ1579499

Hsu-Hao Yang, Yen-Liang Chen

Publication date: 30 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00390-7

zbMATH Keywords

critical pathlongest pathtime-constrained networkactivity network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ Minimizing task completion time with the execution set method ⋮ New computational results for the discrete time/cost trade-off problem with time-switch constraints ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem

Cites Work

• An upper bound on the expected completion time of PERT networks
• Critical path in an activity network with time constraints
• Estimating the mean completion time of PERT networks with exponentially distributed durations of activities
• Activity nets: A guided tour through some recent developments
• Risk taking in stochastic PERT networks
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Probabilistic PERT
• A Multivariate Approach to Estimating the Completion Time for PERT Networks
• The Completion Time of PERT Networks
• Criticality in Stochastic Networks
• The Completion Time of PERT Networks
• Better Estimation of PERT Activity Time Parameters
• The Most Critical Path in a PERT Network
• A generalized activity network model

This page was built for publication: Finding the critical path in an activity network with time-switch constraints