4.6 Article

Robot Scheduling for Mobile-Rack Warehouses: Human-Robot Coordinated Order Picking Systems

期刊

PRODUCTION AND OPERATIONS MANAGEMENT
卷 31, 期 1, 页码 98-116

出版社

WILEY
DOI: 10.1111/poms.13406

关键词

robot scheduling; order picking; human– machine coordination; circadian rhythm; approximate dynamic programming

资金

  1. National Natural Science Foundation of China [71971036, 71421001, 71531002]
  2. Major Program of Key Disciplines in Dalian [2019J11CY002]
  3. Key R&D project of Liaoning Provincial Department of Science and Technology [2020JH2/10100042]
  4. Ministry of Science and Technology of Taiwan, R.O.C. [MOST 109-2410-H-002-076-MY3]
  5. Ministry of Education, Singapore [MOE-2019-T3-1-010]

向作者/读者索取更多资源

Intelligent part-to-picker systems have become popular for agile order fulfillment in various industries, raising challenges in designing work schedules and operational scheduling problems. This study focuses on finding suitable robot schedules considering the fluctuations in human pickers' working states, using a dynamic program model and an ADP-based solution approach. The model, calibrated with data from a leading e-commerce company in China, demonstrates high-quality solutions that reduce picking times by 10% compared to traditional methods.
Intelligent part-to-picker systems are spreading across a broad range of industries as preferred solutions for agile order fulfillment, wherein mobile racks are carried by robots and moved to stations where human pickers can pick items from them. Such systems raise the challenge of designing good work schedules for human pickers; they also give rise to a new class of operational scheduling problems in human-robot coordinated order picking systems. This work studies the problem of finding a suitable robot schedule that takes into account the schedule-induced fluctuation of the working states of human pickers. A proposed model enables mobile racks with various workloads to be assigned to pickers, and schedule the racks that are assigned to every picker to minimize the expected total picking time. The problem is formulated as a stochastic dynamic program model. An approximate dynamic programming (ADP)-based branch-and-price solution approach is used to solve this problem. The developed model is calibrated using data that were collected from a dominant e-commerce company in China. Pickers' working state transitions are modeled based on data obtained from this warehouse. Counter-factual studies demonstrate that the proposed approach can solve a moderately sized problem with 50 racks in under 2 minutes. More importantly, the approach yields high-quality solutions with picking times that are 10% shorter than the solutions that did not consider schedule-induced fluctuations of pickers' working states.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据