A bidirectional heuristic for maximizing the net present value of large-scale projects subject to limited resources

DOI10.1002/NAV.10052zbMATH Open1044.90037OpenAlexW1975636070MaRDI QIDQ4456063FDOQ4456063

Jürgen Zimmermann, Thomas Selle

Publication date: 15 March 2004

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

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

zbMATH Keywords

net present valueproject schedulingpriority rulesgeneral temporal constraintsbidirectional planninglarge-scale projects.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling of resource-constrained projects
• Title not available (Why is that?)
• Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions

Cited In (2)

• A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows
• Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds

   Recommendations

• Title not available (Why is that?) 👍 👎
• On maximizing the net present value of a project under renewable resource constraints 👍 👎
• Heuristic scheduling of resource-constrained projects with cash flows 👍 👎
• Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints 👍 👎
• Scheduling a project to maximize its net present value: An integer programming approach 👍 👎

This page was built for publication: A bidirectional heuristic for maximizing the net present value of large-scale projects subject to limited resources

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