The Study of Minimum Time Algorithm in Intensive Goods Storage Planning

Based on a minimum time algorithm the planning of dense storage with complicated storage objects and numerous storage positions was studied. For the operating space constraints of storage equipment, a pre-solution of minimum storage was given, which was obtained by artificial arrangement. Then, the optimum solution was solved by the Minimum Time Algorithm. The model was built, and it was proved that this planning has been considered to be accurate enough and helpful in practical applications. Especially, the planning has been already used in practical medicine storage.