首页> 外文期刊>International journal of industrial and systems engineering >Analytical approximations to predict order picking times at a warehouse
【24h】

Analytical approximations to predict order picking times at a warehouse

机译:分析近似,以预测仓库中的挑选时间

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

摘要

The primary objective of this research was to develop analytical approximations to predict the time taken to complete a customer order in a warehouse. The problem under study was modelled as a network of queues and the parametric decomposition approach was adopted to develop the approximations. Under this method, the queuing network is decomposed into individual queues allowing to analyse single (i.e., customer order processing, pallet building, and re-pick process) and fork-join stations (i.e., order picking with synchronisation constraints) within the same framework. Analytical formulations to estimate order picking times were developed and compared with equivalent simulation models to estimate the accuracy of the formulations. Appropriate correction terms were also developed to bridge the gap between the analytical approximations and the simulation models. The experimental study conducted indicates that the analytical approximations along with the correction terms can serve as a good estimate for the order picking times in a warehouse.
机译:本研究的主要目标是开发分析近似,以预测在仓库中完成客户订单所需的时间。研究的问题被建模为队列网络,采用参数分解方法来发展近似值。在此方法下,排队网络被分解成各个队列,允许分析同一框架内的单个(即客户订单处理,托盘建筑物和重新选择)和叉协议站(即,在同步约束的顺序拾取) 。开发并与等效模拟模型进行了估算挑选时间的分析制剂,以估计配方的准确性。还开发了适当的校正项以弥合分析近似和模拟模型之间的差距。进行的实验研究表明,分析近似以及校正术语可以作为仓库中的挑选时间的良好估计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号