Maximizing project cash availability

DOI10.1002/NAV.20141MaRDI QIDQ5438525zbMATH OpenOpenAlexFDO

Authors Joseph G. Szmerekovsky, George L. Vairaktarakis

Publication date 23 January 2008

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20141

zbMATH Keywords

algorithmscash availabilitydiscountingnetwork optimizationproject scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows
• Progress payments in project scheduling problems.
• Project Scheduling with Discounted Cash Flows and Progress Payments
• Project network models with discounted cash flows a guided tour through recent developments
• Maximizing the net present value of a project with linear time-dependent cash flows

Cited in

(3)

• An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
• Project scheduling under the threat of catastrophic disruption
• Robust optimization approach for the resource-constrained project scheduling problem with uncertain activity release times

This page was built for publication: Maximizing project cash availability

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