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

zbMATH Open1136.90355MaRDI QIDQ3428841FDOQ3428841

Authors: Levente Mályusz 

Publication date: 29 March 2007

Recommendations

• scientific article; zbMATH DE number 2162229
• PERT scheduling with convex cost functions.
• scientific article; zbMATH DE number 1226309
• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach
• Pdm time cost trade-off:activities are splittable or non-splittable

zbMATH Keywords

time-cost trade off problemMPM/PDM least cost scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (3)

• PERT scheduling with convex cost functions.
• Title not available (Why is that?)
• A network flow procedure for project crashing with penalty nodes

This page was built for publication: Application of activities with monotone increasing cost function in MPM/PDM least cost scheduling ``time-cost trade off problem

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