工作站
调度(生产过程)
计算机科学
机器人
时间范围
运筹学
作业车间调度
移动机器人
工业工程
数学优化
实时计算
地铁列车时刻表
分布式计算
人工智能
工程类
数学
操作系统
作者
Lu Zhen,Zheyi Tan,René de Koster,Shuaian Wang
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2023-09-04
被引量:4
标识
DOI:10.1287/trsc.2022.0265
摘要
Many warehouses involved in e-commerce order fulfillment use robotic mobile fulfillment systems. Because demand and variability can be high, scheduling orders, robots, and storage pods in interaction with manual workstations are critical to obtaining high performance. Simultaneously, the scheduling problem is extremely complicated because of interactions between decisions, many of which must be taken timely because of short planning horizons and a constantly changing environment. This paper models all such scheduling decisions in combination to minimize order fulfillment time. We propose two decision methods for the above scheduling problem. The models batch the orders using different batching methods and assign orders and batches to pods and workstations in sequence and robots to jobs. Order picking and stock replenishment operations are included in the models. We conduct numerical experiments based on a real-world case to validate the efficacy and efficiency of the model and algorithm. Instances with 14 workstations, 400 orders, 300 stock-keeping units (SKUs), 160 pods, and 160 robots can be solved to near optimality within four minutes. Our methods can be applied to large instances, for example, using a rolling horizon. Because our model can be solved relatively fast, it can be used to take managerial decisions and obtain executive insights. Our results show that making integrated decisions, even when done heuristically, is more beneficial than sequential, isolated optimization. We also find that positioning pick stations close together along one of the system’s long sides is efficient. The replenishment stations can be grouped along another side. Another finding is that SKU diversity per pod and SKU dispersion over pods have strong and positive impacts on the total completion time of handling order batches. Funding: This work was supported by National Natural Science Foundation of China [72025103, 72361137001, 71831008, 72071173] and the Research Grants Council of the Hong Kong Special Administrative Region, China [HKSAR RGC TRS T32-707/22-N]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/trsc.2022.0265 .
科研通智能强力驱动
Strongly Powered by AbleSci AI