A network flow procedure for project crashing with penalty nodes

DOI10.1016/0377-2217(84)90072-9zbMATH Open0533.90045OpenAlexW2013073324MaRDI QIDQ790038FDOQ790038

Authors: Arun Kanda, U. R. K. Rao 

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

Recommendations

• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach
• PERT and crashing revisited: Mathematical generalizations
• Project crashing in the presence of general non-linear activity time reduction costs
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Application of activities with monotone increasing cost function in MPM/PDM least cost scheduling ``time-cost trade off problem

zbMATH Keywords

optimality conditionsproject schedulingactivity networkauxiliary sourcesnetwork flow interpretationpenalty nodesprimal dual considerationsproject-cost curve

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A network flow computation for project cost curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Critical Path Problems with Concave Cost-Time Curves
• The Theory of Networks and Management Science. Part I
• A Simple CPM Time-Cost Tradeoff Algorithm
• Network flow, transportation and scheduling. Theory and algorithms
• Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”

Cited In (1)

• Project crashing in the presence of general non-linear activity time reduction costs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790038)