Approximate Dynamic Programming for Dynamic Capacity Allocation with Multiple Priority Levels

@inproceedings{Erdelyi2010ApproximateDP,
  title={Approximate Dynamic Programming for Dynamic Capacity Allocation with Multiple Priority Levels},
  author={Alexander Erdelyi and Huseyin Topaloglu},
  year={2010}
}
In this paper, we consider a quite general dynamic capacity allocation problem. There is a fixed amount of daily processing capacity. On each day, jobs of different priorities arrive randomly and we need to decide which jobs should be scheduled for which days. Waiting jobs incur a holding cost depending on their priority levels. The objective is to minimize the total expected cost over a finite planning horizon. We begin by formulating the problem as a dynamic program, but this formulation is… CONTINUE READING