Critical path in an activity network with time constraints
From MaRDI portal
Publication:1278077
DOI10.1016/S0377-2217(96)00140-3zbMath0930.90039OpenAlexW2087162576MaRDI QIDQ1278077
Yen-Liang Chen, Kwei Tang, Dan B. Rinks
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00140-3
PERTcritical pathlongest pathacyclic graphactivity networkprecedence relationshipsfloat timetime-window constraint
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
The discrete time/cost trade-off problem: Extensions and heuristic procedures, Scheduling in supply chain environment, Modelling and solving generalised operational surgery scheduling problems, Theory and application of reciprocal transformation of “path problem” and “time float problem”, Shipping problems with body clock constraints., Minimizing task completion time with the execution set method, Re-planning support system for make-to-order production with reserved resources, A solution approach to find the critical path in a time-constrained activity network, Finding the critical path in an activity network with time-switch constraints
Cites Work
- An upper bound on the expected completion time of PERT networks
- The pickup and delivery problem with time windows
- Estimating the mean completion time of PERT networks with exponentially distributed durations of activities
- 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
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- 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