Improving Order-Picking Response Time at Ankor's Warehouse
暂无分享,去创建一个
Rommert Dekker | Kees Jan Roodbergen | René M. B. M. de Koster | K. J. Roodbergen | H. van Kalleveen | R. Dekker | R. Koster | H. V. Kalleveen
[1] A. Volgenant,et al. Nonoptimal Edges for the Symmetric Traveling Salesman Problem , 1984, Oper. Res..
[2] Charles J. Malmborg,et al. Optimization of cube-per-order index warehouse layouts with zoning constraints , 1995 .
[3] Stephen C. Graves,et al. Optimal Storage Assignment in Automatic Warehousing Systems , 1976 .
[4] RenÉ De Koster,et al. Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions , 1998 .
[5] Stephen C. Graves,et al. Storage-Retrieval Interleaving in Automatic Warehousing Systems , 1977 .
[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[7] Charles G. Petersen. The impact of routing and storage policies on warehouse efficiency , 1999 .
[8] Randolph W. Hall,et al. DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE , 1993 .
[9] Ed Anan Shetty,et al. Literature , 1965, Science.
[10] Richard L. Daniels,et al. A model for warehouse order picking , 1998, Eur. J. Oper. Res..
[11] Kees Jan Roodbergen,et al. Routing methods for warehouses with multiple cross aisles , 2001 .
[12] Kees Jan Roodbergen,et al. Routing order pickers in a warehouse with a middle aisle , 2001, Eur. J. Oper. Res..
[13] Roger W. Schmenner,et al. An Evaluation of Routing and Volume‐based Storage Policies in an Order Picking Operation , 1999 .
[14] R. Jonker,et al. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .
[15] H. D. Ratliff,et al. Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..
[16] Charles G. Petersen. An evaluation of order picking routeing policies , 1997 .