Scattered Storage: How to Distribute Stock Keeping Units All Around a Mixed-Shelves Warehouse

Published Online:https://doi.org/10.1287/trsc.2017.0779

References

  • Bartholdi JJ III, Hackman ST (2014) Warehouse and distribution science. Working paper, release 0.96, Georgia Institute of Technology, Atlanta.Google Scholar
  • Current J, Daskin M, Schilling D (2002) Discrete network location models. Drezner Z, Hamacher HW, eds. Facility Location Applications and Theory (Springer, Berlin Heidelberg), 81–118.CrossrefGoogle Scholar
  • Daniels RL, Rummel JL, Schantz R (1998) A model for warehouse order picking. Eur. J. Oper. Res. 105:1–17.CrossrefGoogle Scholar
  • de Koster RB, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: A literature review. Eur. J. Oper. Res. 182:481–501.CrossrefGoogle Scholar
  • Elberse A (2008) Should you invest in the long tail? Harvard Bus. Rev. 86:88–96.Google Scholar
  • Ferguson DE (1960) Fibonaccian searching. Comm. ACM 3:648.CrossrefGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability (Freeman, New York).Google Scholar
  • Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: A comprehensive review. Eur. J. Oper. Res. 177:1–21.CrossrefGoogle Scholar
  • Gu J, Goetschalckx M, McGinnis LF (2010) Research on warehouse design and performance evaluation: A comprehensive review. Eur. J. Oper. Res. 203:539–549.CrossrefGoogle Scholar
  • Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13:462–475.LinkGoogle Scholar
  • Handler GY (1979) Complexity and efficiency in minimax network location. Christofides N, Mingozzi A, Toth P, Sandi C, eds. Combinatorial Optimization (John Wiley & Sons, Chichester, UK),281–314.Google Scholar
  • Handler GY, Mirchandani PB (1979) Location on Networks (MIT Press, Cambridge, MA).Google Scholar
  • Heskett JL (1963) Cube-per-order index—A key to warehouse stock location. Transportation Distribution Management 3:27–31.Google Scholar
  • Karp RM (1972) Reducibility among combinatorial problems. Miller RE, Thatcher JW, eds. Complexity of Computer Computations (Plenum, New York), 85–103.CrossrefGoogle Scholar
  • Klose A, Drexl A (2005) Facility location models for distribution system design. Eur. J. Oper. Res. 162:4–29.CrossrefGoogle Scholar
  • Mucha M, Sankowski P (2004) Maximum matchings via Gaussian elimination, Proc. 45st IEEE Symp. Foundations Comput. Sci. (IEEE, New York), 248–255.Google Scholar
  • Petersen CG, Aase G, Heiser DR (2004) Improving order-picking performance through the implementation of class-based storage. Internat. J. Physical Distribution Logist. Management 34:534–544.CrossrefGoogle Scholar
  • Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper. Res. 19:1363–1373.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.