期刊
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS
卷 11, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.ejtl.2022.100085
关键词
Facility logistics; Warehousing; Crane scheduling; Vehicle routing
资金
- German Science Foundation (DFG) [BO 3148/14-1]
The parts-to-picker system can relieve order pickers from walking in the warehouse and improve efficiency. We study the crane scheduling problem in this system and prove its strong NP-hardness. We also find that this problem is equivalent to the traditional vehicle routing problem.
To relieve human order pickers from unproductive walking through a warehouse, parts-to-picker systems deliver demanded stock keeping units (SKUs) toward picking workstations. In a wide-spread parts-to-picker setup, a crane-operated automated storage and retrieval system (ASRS) delivers bins with demanded SKUs toward an end-of-aisle picking workstation and returns them back into the rack once the picks are completed. We consider the scheduling of the crane that operates subsequent dual commands. Each dual command combines a retrieval request for another SKU bin demanded at the picking workstation with a storage request, where a bin that has already been processed and passed through the bin buffer is returned to its dedicated storage position in the ASRS. This system setup in general and the resulting crane scheduling problem in particular have been an active field of research for more than 30 years. We add the following contributions to this stream of research: We finally prove that the crane scheduling problem is strongly NP-hard. Furthermore, we show that, although only a single vehicle (namely, the crane) is applied, the problem is equivalent to the traditional vehicle routing problem (VRP). This opens the rich arsenal of very efficient VRP solvers, which substantially outperform existing tailor-made algorithms from the literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据