Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming

Project scheduling problems with both resource constraints and uncertain task durations have applications in a variety of industries. While the existing research literature has been focusing on finding an a priori open-loop task sequence that minimizes the expected makespan, finding a dynamic and ad...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 246; H. 1; S. 20 - 33
Hauptverfasser:	Li, Haitao, Womer, Norman K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.10.2015 Elsevier Sequoia S.A
Schlagworte:	Algorithms Approximate dynamic programming Approximation Dynamic programming Heuristic Project management Resource-constrained project scheduling Scheduling algorithms Simulation Stochastic models Stochastic scheduling Studies Uncertain task durations Uncertain task durations Stochastic scheduling Approximate dynamic programming Resource-constrained project scheduling Simulation
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!