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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of heuristics Ročník 16; číslo 2; s. 189 - 209
Hlavní autori:	Herbots, Jade, Herroelen, Willy, Leus, Roel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.04.2010 Springer Science + Business Media Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!