Minimizing the peak load: An alternate objective for dedicated storage policies

This paper deals with the problem of minimizing, over a fixed horizon, the peak load in single-command cycle dedicated storage policies. The daily load is the expected total time of the command cycles and the peak load is an approximation of the maximum daily processing capacity requirement. Mixed integer programming models are presented and their solutions are compared to turnover-based solutions, which are known to minimize the average load per day. It is shown that turnover-based solutions may not be suitable for the peak load criterion.