Finding the critical path in an activity network with time-switch constraints
type: Item
instance of: scholarly article
title: Finding the critical path in an activity network with time-switch constraints
zbMATH Open document ID: 0962.90006
DOI: 10.1016/S0377-2217(98)00390-7
author: Hsu-Hao Yang
author: Yen-Liang Chen
published in: European Journal of Operational Research
publication date: 2001-01-30T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1506725
zbMATH Keywords: activity network
zbMATH Keywords: critical path
zbMATH Keywords: longest path
zbMATH Keywords: time-constrained network
MaRDI profile type: Publication
cites work: Activity nets: A guided tour through some recent developments
cites work: Better Estimation of PERT Activity Time Parameters
cites work: Estimating the mean completion time of PERT networks with exponentially distributed durations of activities
cites work: Probabilistic PERT
cites work: Risk taking in stochastic PERT networks
cites work: Criticality in Stochastic Networks
cites work: The Most Critical Path in a PERT Network
cites work: A Multivariate Approach to Estimating the Completion Time for PERT Networks
cites work: An upper bound on the expected completion time of PERT networks
cites work: The Completion Time of PERT Networks
cites work: A generalized activity network model
cites work: Critical path in an activity network with time constraints
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
full work available at URL: s0377-2217(98)00390-7
OpenAlex ID: W2025005527
description: scientific article; zbMATH DE number 1506725