Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach

DOI10.1057/PALGRAVE.JORS.0470509MaRDI QIDQ4717128zbMATH OpenOpenAlexFDO

Authors Steve Jun. Phillips

Publication date 1 December 1996

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

zbMATH Keywords

activity-on-arc networksCPMgraphical cut search approachPERTproject management duration/resource tradeoff problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The discrete time-cost tradeoff problem revisited
• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach
• Local search methods for the discrete time/resource trade-off problem in project networks
• New computational results on the discrete time/cost trade-off problem in project networks
• An application of randomized minimum cut to the project time/cost tradeoff problem

Cited in

(4)

• An application of randomized minimum cut to the project time/cost tradeoff problem
• Seeking optimum project duration extensions
• scientific article; zbMATH DE number 4197723 (Why is no real title available?)
• A heuristic procedure for solving the dynamic probabilistic project expediting problem

This page was built for publication: Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach

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