Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach

DOI10.1057/PALGRAVE.JORS.2600489MaRDI QIDQ4383676zbMATH OpenOpenAlexFDO

Authors

Publication date 2 April 1998

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600489

zbMATH Keywords

project managementminimum cost network flowcritical path analysisminimum capacity cut-set

Mathematics Subject Classification ID

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

Recommendations

• A network flow procedure for project crashing with penalty nodes
• scientific article; zbMATH DE number 2162229
• scientific article; zbMATH DE number 1226309
• Critical path planning under uncertainty
• The discrete time-cost tradeoff problem revisited

Cited in

(10)

• Solving time-cost trade-off model for activity network by minimum cost flow principle
• scientific article; zbMATH DE number 4072334 (Why is no real title available?)
• A float-path theory and its application to the time-cost tradeoff problem
• Critical path planning under uncertainty
• scientific article; zbMATH DE number 2162229 (Why is no real title available?)
• Application of activities with monotone increasing cost function in MPM/PDM least cost scheduling ``time-cost trade off problem
• A heuristic procedure for solving the dynamic probabilistic project expediting problem
• A solution approach to find the critical path in a time-constrained activity network
• A network flow procedure for project crashing with penalty nodes
• Cost – Time Trade Off Models Application to Crashing Flow Shop Scheduling Problems

This page was built for publication: Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach

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