Uncertain Critical Paths, HyperWeighted Critical Paths, and Critical HyperPaths

Classical Critical Path analysis uses fixed activity durations in a directed acyclic project network. We develop three distinct mathematical extensions: Uncertain Critical Paths, which aggregate model-dependent uncertainty values and rank the resulting path scores; HyperWeighted Critical Paths, which aggregate nonempty sets of admissible durations by Minkowski addition; and Critical HyperPaths, which optimize over alternating paths in directed hypergraphs. We establish existence of maximizing paths under explicit finiteness, admissibility, aggregation, and ranking assumptions. We further show that singleton hyperweights recover the classical Critical Path formulation, and demonstrate the dependence of set-valued critical-path selection on the ranking functional. The scope and limitations of these constructions, including the interpretation of uncertainty degrees, scenario dependence, and hyperpath precedence semantics, are clarified.

Authors

Publication Details

Journal
Preprints.org
Published
2026-11-12
DOI
https://doi.org/10.20944/preprints202611.1284.v1
Primary Topic
Resource-Constrained Project Scheduling
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Uncertain Critical Paths, HyperWeighted Critical Paths, and Critical HyperPaths

Takaaki Fujita
Preprints.org
Resource-Constrained Project Scheduling
preprint

Uncertain Critical Paths, HyperWeighted Critical Paths, and Critical HyperPaths

Takaaki Fujita
preprint en

Abstract

Classical Critical Path analysis uses fixed activity durations in a directed acyclic project network. We develop three distinct mathematical extensions: Uncertain Critical Paths, which aggregate model-dependent uncertainty values and rank the resulting path scores; HyperWeighted Critical Paths, which aggregate nonempty sets of admissible durations by Minkowski addition; and Critical HyperPaths, which optimize over alternating paths in directed hypergraphs. We establish existence of maximizing paths under explicit finiteness, admissibility, aggregation, and ranking assumptions. We further show that singleton hyperweights recover the classical Critical Path formulation, and demonstrate the dependence of set-valued critical-path selection on the ranking functional. The scope and limitations of these constructions, including the interpretation of uncertainty degrees, scenario dependence, and hyperpath precedence semantics, are clarified.

Preprints.org
Resource-Constrained Project Scheduling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon