Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming

Resource Constraint Project Scheduling Problems with Discounted Cash Flows (RCPSPDC) focuses on maximizing the net present value by summing the discounted cash flows of project activities. An extension of this problem is the Payment at Event Occurrences (PEO) scheme, where the client makes multiple...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithms Jg. 17; H. 5; S. 180
Hauptverfasser:	Phuntsho, Tshewang, Gonsalves, Tad
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.05.2024
Schlagworte:	Algorithms Ant Colony Optimization approximate dynamic programming Approximation Capital budgeting Cash flow Cash flow forecasting Computational efficiency Computer simulation Contract negotiations Contractors discounted cash flows Discrete Cuckoo Search Dynamic programming Estimation of Distribution Algorithm Heuristic methods Literature reviews Maximization Monte Carlo method Monte Carlo simulation Net present value Project management Resource scheduling Schedules Scheduling Simulation New Jersey Germany
ISSN:	1999-4893, 1999-4893
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!