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.

[1]  J. R. Bokehi,et al.  Information system for supporting pharmacoepidemiology activities at drug information centers in Brazil , 2003, Proceedings of the 25th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (IEEE Cat. No.03CH37439).

[2]  D. Unfricht,et al.  Automating the pharmacy: implementing Cerner's Millenium Pharmnet System , 2000, Proceedings of the IEEE 26th Annual Northeast Bioengineering Conference (Cat. No.00CH37114).

[3]  G. Scheithauer,et al.  Modeling of packing problems , 1993 .

[4]  M. Kuhl,et al.  EVALUATING HOSPITAL PHARMACY STAFFING AND WORK SCHEDULING USING SIMULATION , 2005 .

[5]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[6]  Vittaya Tipsuwanporn,et al.  A design of automatic warehouse for Internet based system , 2002, 2002 IEEE International Conference on Industrial Technology, 2002. IEEE ICIT '02..