Improving order-picking response time at Ankor's warehouse

Interfaces

Volumn 34, Issue 4, 2004, Pages 303-313

  Dekker, R ^a   De Koster, M B M ^b   Roodbergen, K J ^b   Van Kalleveen, H ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b ERASMUS UNIVERSITY   (Netherlands)

^c 1117 2L Schiphol Centrum   (Netherlands)

Author keywords

Facilities: equipment planning; Layout simulation: applications

Indexed keywords

EID: 4544362749     PISSN: 00922102     EISSN: None     Source Type: Journal    
DOI: 10.1287/inte.1040.0083     Document Type: Article

References (17)

1. Daniels, R. L., J. L. Rummel, R. Schantz. 1998. A model for warehouse order picking. Eur. J. Oper. Res. 105(1) 1-17.
2. De Koster, R., E. S. Van der Poort. 1998. Routing orderpickers in a warehouse: A comparison between optimal and heuristic solutions. IIE Trans. 30(5) 469-480.
3. Graves, S. C., W. H. Hausman, L. B. Schwarz. 1977. Storage-retrieval interleaving in automatic warehousing systems. Management Sci. 23(9) 935-945.
4. Hall, R. W. 1993. Distance approximations for routing manual pickers in a warehouse. IIE Trans. 25(4) 76-87.
5. Hausman, W. H., L. B. Schwarz, S. C. Graves. 1976. Optimal storage assignment in automatic warehousing systems. Management Sci. 22(6) 629-638.
6. Jonker, R., A. Volgenant. 1984. Nonoptimal edges for the symmetric traveling salesman problem. Oper. Res. 32(4) 837-846.
7. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2) 498-516.
8. Little, J. D. C., K. G. Murty, D. W. Sweeney, C. Karel. 1963. An algorithm for the traveling salesman problem. Oper. Res. 11(6) 972-989.
9. Malmborg, C. J. 1995. Optimization of cube-per-order index warehouse lay-out with zoning constraints. Internat. J. Production Res. 33(2) 465-482.
10. Petersen, C. G. 1997. An evaluation of order picking routing policies. Internat. J. Oper. Production Management 17(11) 1098-1111.
11. Petersen, C. G. 1999. The impact of routing and storage policies on warehouse efficiency. Internat. J. Oper. Production Management 19(9-10) 1053-1064.
12. Petersen, C. G., R. W. Schmenner. 1999. An evaluation of routing and volume-based storage policies in an order picking operation. Decision Sci. 30(2) 481-501.
13. Ratliff, H. D., A. S. Rosenthal. 1983. Order picking in a rectangular warehouse: A solvable case of the traveling salesman problem. Oper. Res. 31(3) 507-521.
14. Roodbergen, K. J., R. De Koster. 2001a. Routing order pickers in a warehouse with a middle aisle. Eur. J. Oper. Res. 133(1) 32-43.
15. Roodbergen, K. J., R. De Koster. 2001b. Routing methods for warehouses with multiple cross aisles. Internat. J. Production Res. 39(9) 1865-1883.
16. Tompkins, J. A., J. A. White, Y. A. Bozer, J. M. A. Tanchoco. 2003. Facilities Planning. John Wiley and Sons, New York.
17. Volgenant, A., R. Jonker. 1982. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Oper. Res. 9(1) 83-89.