...
首页> 外文期刊>International Journal of Production Research >Zone merge sequencing in an automated order picking system
【24h】

Zone merge sequencing in an automated order picking system

机译:自动拣货系统中的区域合并排序

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

摘要

This paper considers the zone automated order fulfilment systems with a number of zones linked by a main conveyor. Each zone has a number of dispensers and a buffer. Each dispenser holds one type of item and dispenses the items for an order into a buffer before the items are merged to the main conveyor. Due to variability of the mix of item types and number of items for each type in successive orders, idle time or open space on the conveyor can occur if the buffers merge the items to the conveyor sequentially. The idle time prolongs the order fulfilment duration. This paper aims to provide a solution to reduce the idle time or open space by optimising the merging sequences among zones. A model is developed to find merging sequences with minimum order fulfilment time. However, the model is strongly NP-hard. A greedy heuristic-based solution approach is thus developed. Experiment performance shows that the presented solution can reduce the order fulfilment time approximately 5% with both empirical data and simulation data. Moreover, the sensitivity analysis is conducted to measure the effect of the solution under the variation of zone numbers and order structures. Although the idle time reduction can be achieved with any number of zones and order structures, it was most significant in certain range of zone numbers and appropriate order structures.
机译:本文考虑了一个区域自动订单履行系统,该系统具有通过主输送机链接的多个区域。每个区域都有许多分配器和一个缓冲区。每个分配器都持有一种类型的物品,并将要订购的物品分配到缓冲区中,然后将这些物品合并到主传送带中。由于物品类型和每种类型物品的数量在连续订单中的混合性会发生变化,因此,如果缓冲区将物品顺序合并到传送带上,则可能会在传送带上出现空闲时间或空地。空闲时间会延长订单执行时间。本文旨在通过优化区域之间的合并顺序,提供一种减少空闲时间或空地的解决方案。开发了一个模型,以找到具有最小订单履行时间的合并序列。但是,该模型具有很强的NP难度。因此,开发了一种基于贪婪启发式的解决方案。实验性能表明,无论是经验数据还是仿真数据,所提出的解决方案都可以将订单履行时间减少约5%。此外,进行敏感性分析以测量在区域数和阶数结构变化下溶液的效果。尽管可以使用任意数量的区域和订单结构来实现空闲时间的减少,但在一定范围的区域编号和适当的订单结构中,闲置时间的减少最为重要。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号