Skip to main content

Optimizing the Allocation of Cuboidal Boxes to Cuboidal Compartments for Storage in a Warehouse

  • Chapter
  • 3212 Accesses

Part of the International Series in Operations Research & Management Science book series (ISOR,volume 212)

Abstract

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.

Keywords

  • Dynamic Version
  • Storage Pattern
  • Primal Simplex Algorithm
  • Empty Compartment
  • Footwear Manufacturer

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4939-1007-6_12
  • Chapter length: 18 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   109.00
Price excludes VAT (USA)
  • ISBN: 978-1-4939-1007-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   149.99
Price excludes VAT (USA)
Hardcover Book
USD   149.99
Price excludes VAT (USA)
Fig. 12.1
Fig. 12.2

Notes

  1. 1.

    http://www.springer.com/business+%26+management/operations+research/book/978-1-4939-1006-9

References

  1. Bengtsson, B. E. (1982). Packing rectangular pieces—a heuristic approach. The Computer Journal, 25, 353–357.

    CrossRef  Google Scholar 

  2. Chung, F. K.R., Garey, M. R., & Johnson, D. S. (1982). On packing two-dimensional bins. SIAM Journal of Algebraic and Discrete Methods, 3, 66–76.

    CrossRef  Google Scholar 

  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 

  6. Dyckhoff, H. (1990). A typology of cutting and packing problem. European Journal of Operational Research, 44, 145–159.

    CrossRef  Google Scholar 

  7. Dyckhoff, H., & Finke, U. (1992). Cutting and packing in production and distribution: A typology and bibliography. Heidelberg: Physica-Verlag.

    CrossRef  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 

  9. Haessler, R. W., & Sweeney, P. E. (1991). Cutting stock problems and solution procedures. European Journal of Operational Research, 54, 141–150.

    CrossRef  Google Scholar 

  10. Hinxman, A. I. (1980). The trim-loss and assortment problems: A survey. European Journal of Operational Research, 5, 8–18.

    CrossRef  Google Scholar 

  11. Murthy, A. L. N. (2012). Space optimization for warehousing problem: A Methodology for Decision Support System. Management Science and Financial Engineering, 18(1), 39–48.

    CrossRef  Google Scholar 

  12. Murty, K. G. (1992). Network programming. Angelwood Cliffs: Prentice-Hall.

    Google Scholar 

  13. Sweeney, P. E., &Paternoster, E. R. (1992). Cutting and packing problems: A categorized, application-orientated research bibliography. Journal of the Operational Research Society, 43(7), 691–706.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. S. R. Murthy .

Editor information

Editors and Affiliations

1 Electronic supplementary material

Rights and permissions

Reprints and Permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this chapter

Cite this chapter

Murthy, G.S.R., Murthy, A.L.N., Murty, K.G. (2015). Optimizing the Allocation of Cuboidal Boxes to Cuboidal Compartments for Storage in a Warehouse. In: Murty, K. (eds) Case Studies in Operations Research. International Series in Operations Research & Management Science, vol 212. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-1007-6_12

Download citation