The system can be modeled as a continuous-time infinite-horizon dynamic program, but suffers from the curse of dimensionality when different customer classes have different service rates. We use ...

The Dynamic and Stochastic Knapsack Problem (DSKP) is defined as follows. Items arrive according to a Poisson process in time. Each item has a demand (size) for a limited resource (the knapsack) and ...

F. Polimeno, T. Rehman, H. Neal, C. M. Yates, Integrating the use of Linear and Dynamic Programming Methods for Diary Cow Diet Formulation, The Journal of the ...