Critical path determination by incorporating minimum and maximum time and distance constraints into linear scheduling

Abstract

A scheduling method for determining the critical path in linear projects is presented, that takes into account maximum time and distance constraints in addition to the commonly used minimum time and distance constraints. The maximum constraints, though often present in the specifications of a project, are not considered during the planning procedure, since no method existed to enable scheduling with them. The proposed method builds on the concept of the maximum constraints and expands on the necessary background for their implementation into the schedule. The introduced critical path algorithm allows for grouping linear activities into four categories regarding their critical status and their ability to influence project duration. The method is applied to a low‐pressure pipeline construction project and the results are presented.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 51 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.