Pdm time cost trade-off:activities are splittable or non-splittable

DOI10.1080/02331939608844245MaRDI QIDQ2785398zbMATH OpenOpenAlexFDO

Authors Miklós Hajdu

Publication date 4 August 1997

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939608844245

zbMATH Keywords

activity splittingleast cost schedulingnetwork techniquesprecedence diagrammingproject managementtime cost trade-off

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 1226310
• Application of activities with monotone increasing cost function in MPM/PDM least cost scheduling ``time-cost trade off problem
• scientific article; zbMATH DE number 2162229
• The discrete time-cost tradeoff problem revisited

Cites work

• A network flow computation for project cost curves
• Critical-Path Planning and Scheduling: Mathematical Basis

Cited in

(1)

• Application of activities with monotone increasing cost function in MPM/PDM least cost scheduling ``time-cost trade off problem

This page was built for publication: Pdm time cost trade-off:activities are splittable or non-splittable

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