Exact and Heuristic Methods to Minimize the Peak Load of Shared Storage Policies

, , , and

BibTeX reference

We study the problem of minimizing the peak load in single-command cycle shared storage policies. The peak load is the maximum of the daily material handling durations. We suggest exact and heuristic solutions. The exact solution is produced by column generation. This solution is obtainable in reasonable CPU time only for limited size problems. The new heuristic solutions assign units handled during busy days to close locations and are obtainable for large scale problems. For simulated problems, these policies reduce drastically the peak load compared to classical ones.

, 26 pages

Research Axis

Research application