Optimizing the Allocation of Cuboidal Boxes to Cuboidal Compartments for Storage in a Warehouse
In this chapter we consider the problem of managing the storage space optimally at a warehouse for storing cuboidal boxes in cuboidal compartments. Footwear manufacturers face this problem for storing shoe boxes; drug companies manufacturing medicines packed in cartons cuboidal in shape face the same problem, etc. Typically, warehouse management problems involve continual storage and retrieval (issues) of goods from the warehouse. Therefore, a scheme is required to handle the dynamic storage and retrieval of goods optimally from the warehouse. In this chapter we will discuss an efficient procedure for developing a decision support system for the dynamic warehouse management problem. The source for this chapter is based on the work done by Das and a subsequent paper by Murthy A. L. N.
KeywordsDynamic Version Storage Pattern Primal Simplex Algorithm Empty Compartment Footwear Manufacturer
- 3.Coffman, E. G. Jr., Garey, M. R., & Johnson, D. S. (1996). Approximation algorithms for bin packing: A survey. In D. S. Hochhaum (Ed.), Approximation algorithms for NP-Hard problems. (pp. 46–93). Boston: PWS Publishing Company.Google Scholar
- 4.Coffman, E. G. Jr., Galambos, G., Martello, S., & Vigo, D. (1998). Bin packing approximation algorithms: combinatorial analysis. In D. Z. Du & P. M. Paradalos (Eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers.Google Scholar
- 5.Das, P. (2005). A heuristic approach for arrangement of footwear boxes to maximize space utilization and related business issues. International Journal of Management Science, 11(2), 61–84.Google Scholar
- 8.El-Bouri, A., Popplewell, N., Balakrishnan, S. & Alfa, A. (1994). A search based heuristic for the two-dimensional bin-packing problem. INFOR, 32, 265–274.Google Scholar
- 12.Murty, K. G. (1992). Network programming. Angelwood Cliffs: Prentice-Hall.Google Scholar