The problem is to dynamically store different data records in different storage devices in each period so as to minimize the total expected discounted cost over a planning horizon. Each device has a fixed total capacity, each record has a given storage space requirement, while the number of requests for each record per period is changing stochastically through time. Given an allocation, the total cost per period consists of the storage cost (depending on the storage requirements and device), the access cost including update and retrieval costs (depending on the number of requests) and the transfer cost (depending upon the change of allocation from the previous period). A dynamic programming model is presented to yield optimal strategies. The special case of independent identically distributed demands is completely solved, using a generalized transportation algorithm while a heuristic procedure is indicated for the general problem using parametric analysis.
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering