Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Space Optimization for Warehousing Problem: A Methodology for Decision Support System

  • Murthy, A.L.N. (Indian Statistical Institute)
  • Received : 2008.08.07
  • Accepted : 2012.04.17
  • Published : 2012.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

This article presents a way of tackling a special class of space optimization problems that arise in a number of practical applications in industry and elsewhere. It presents an elegant solution to a problem that was considered by (Das, 2005) in optimizing storage space in warehouse of a footwear manufacturing company. In (Das, 2005), the problem was formulated as a nonlinear programming problem. In this article, it is shown that the problem can be formulated as a generalized transportation problem which is a special case of generalized network flow problems. Further, an elegant scheme is devised to handle the dynamic situation of warehousing problem which can be easily translated into a decision support system for the warehouse management system. Also, the article points out certain obscurities and gaps in (Das, 2005).

Keywords

References

  1. Bengtsson., B. E., "Packing rectangular pieces-a heuristic approach," The Computer Journal 25 (1982), 353- 357. https://doi.org/10.1093/comjnl/25.3.353
  2. Chung, F. K .R., M. R. Garey, and D. S. Johnson, "On packing two- dimensional bins," SIAM Journal of Algebraic and Discrete Methods 3 (1982), 66-76. https://doi.org/10.1137/0603007
  3. Coffman Jr., E. G., G. Galambos, S. Martello, and D. Vigo, "Bin packing approximation algorithms: combinatorial analysis," In Handbook of Combinatorial Optimization, edited by D. Z. Du and P. M. Paradalos: Kluwer Academic Publishers, 1998.
  4. Coffman, Jr., E. G., M. R. Garey, and D. S. Johnson, "Bin packing approximation algorithms: a survey," In Approximation Algorithms for NP-Hard Problems, editer by D. Hochhaum. Boston: PWS Publishing Company, 1996.
  5. Das, P., "A Heuristic Approach for arrangement of Footwear Boxes to maximize Space Utilization and related Business Issues," International Journal of Management Science 11, 2 (2005), 61-84.
  6. Dyckhoff, H., "A Typology of Cutting and Packing Problem," European Journal of Operational Research 44 (1990), 145-159. https://doi.org/10.1016/0377-2217(90)90350-K
  7. Dyckhoff, H. and U. Finke, "Cutting and Packing in Production and Distribution: A Typology and Bibliography," Physica-Verlag, Heidelberg, 1992.
  8. El-Bouri, A., N. Popplewell, S. Balakrishnan, and A. Alfa, "A search based heuristic for the two-dimensional bin-packing problem," INFOR 32 (1994), 265- 274.
  9. Haessler, R. W. and P. E. Sweeney, "Cutting Stock Problems and Solution Procedures," European Journal of Operational Research 54 (1991), 141-150. https://doi.org/10.1016/0377-2217(91)90293-5
  10. Hinxman, A. I., "The Trim-Loss and Assortment Problems: A Survey," European Journal of Operational Research 5 (1980), 8-18. https://doi.org/10.1016/0377-2217(80)90068-5
  11. Murty, K. G., Network Programming, Prentice-Hall, Angelwood Cliffs, NJ, 1992.
  12. Sweeney, P. E. and E. R. Paternoster, "Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography," Journal of the Operational Research Society 43, 7 (1992), 691-706. https://doi.org/10.1057/jors.1992.101