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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 16; no. 2; pp. 189 - 209
Main Authors:	Herbots, Jade, Herroelen, Willy, Leus, Roel
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.04.2010 Springer Science + Business Media Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!