A network flow procedure for project crashing with penalty nodes

DOI10.1016/0377-2217(84)90072-9zbMath0533.90045OpenAlexW2013073324MaRDI QIDQ790038

U. R. K. Rao, Arun Kanda

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90072-9

zbMATH Keywords

project schedulingoptimality conditionsactivity networkauxiliary sourcesnetwork flow interpretationpenalty nodesprimal dual considerationsproject-cost curve

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Network flow, transportation and scheduling. Theory and algorithms
• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”
• The Theory of Networks and Management Science. Part I
• A Simple CPM Time-Cost Tradeoff Algorithm
• Critical Path Problems with Concave Cost-Time Curves

This page was built for publication: A network flow procedure for project crashing with penalty nodes