Travel time analysis for general item location assignment in a rectangular warehouse
暂无分享,去创建一个
[1] H. D. Ratliff,et al. Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..
[2] Qi-Ming He,et al. Flow time in the MAP/G/1 queue with customer batching and setup times , 1995 .
[3] John A. Buzacott,et al. Stochastic models of manufacturing systems , 1993 .
[4] Randolph W. Hall,et al. DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE , 1993 .
[5] Gunter P. Sharp,et al. Order batching procedures , 1992 .
[6] Timm Gudehus,et al. Mittlere Wegzeiten beim eindimensionalen Kommissionieren , 1975, Z. Oper. Research.
[7] H D Ratliff,et al. Order Picking In An Aisle , 1988 .
[8] David M. Lucantoni,et al. New results for the single server queue with a batch Markovian arrival process , 1991 .
[9] Qi-Ming He,et al. Flow Time Distributions In Queues With Customer Batching And Setup Times , 1997 .
[10] Norman L. Johnson,et al. Urn models and their application , 1977 .
[11] Bhaba R. Sarker,et al. Travel time models in automated storage/retrieval systems: A critical review , 1995 .
[12] Marc Goetschalckx,et al. An efficient algorithm to cluster order picking items in a wide aisle , 1986 .
[13] Hirotaka Sakasegawa,et al. An approximation formulaLq ≃α·ρβ/(1-ρ) , 1977 .