首页> 外文期刊>IEEE Transactions on Systems, Man, and Cybernetics >Optimal storage assignment policies for multiaddress warehousing systems
【24h】

Optimal storage assignment policies for multiaddress warehousing systems

机译:多地址仓库系统的最佳存储分配策略

获取原文
获取原文并翻译 | 示例
           

摘要

The authors investigate the optimal storage assignment policy for a multiaddress warehousing system using a dedicated storage discipline and aisle captive, man-aboard vehicles performing item retrieval. A modeling scenario is presented which is designed to reflect warehousing practices emphasizing short-order picking cycle times and integrated operational control. Two theorems and proofs that are useful for finding optimal warehouse layouts based on a mathematical model of order picking costs for the case of aisle captive, multicommand order picking cycles are introduced. The results reported indicate one means for potentially decomposing the integrated warehousing problem to obtain locally optimal warehouse layouts for fixed inventory levels.
机译:作者研究了一种多地址仓库系统的最佳存储分配策略,该策略使用专用的存储规则和执行项目检索的过道俘虏,载人车辆。提出了一个建模方案,该方案旨在反映强调短订单拣货周期时间和集成运营控制的仓储实践。引入了两个定理和证明,这些定理和证明对于基于通道捕获,多命令拣货周期的拣货成本的数学模型,可以找到最佳的仓库布局。报告的结果表明,一种潜在的方法可以分解集成的仓储问题,以获取针对固定库存水平的本地最佳仓库布局。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号