Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning

This paper investigates dynamic order acceptance and capacity planning under limited regular and non-regular resources. Our goal is to maximize the profits of the accepted projects within a finite planning horizon. The way in which the projects are planned affects their payout time and, as a consequ...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of heuristics Jg. 16; H. 2; S. 189 - 209
Hauptverfasser:	Herbots, Jade, Herroelen, Willy, Leus, Roel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.04.2010 Springer Science + Business Media Springer Nature B.V
Schlagworte:	Algorithms Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Dynamic programming Interest rates Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Planning Simulation Studies Workloads Approximate dynamic programming Order acceptance Simulation Multi-project Capacity planning
ISSN:	1381-1231, 1572-9397
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!