.png){kind=icon}
返回
Order processing task allocation and scheduling for E-order fulfilment
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2021.2018140.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper mainly studies a task allocation and scheduling problem in the multi-thread fulfilment process of electronic order, which seeks to minimise the makespan under thread constraints and order precedence constraints. The problem is formulated as a Mixed Integer Programming (MIP) model and a novel depth-first heuristic is proposed to solve it. The depth-first heuristic shows high effectiveness and efficiency, compared with the current policy and the genetic algorithm in both small/medium-scale and large-scale cases from the real transaction data. In addition, two extensions on precedence constraint reduction and resource allocation are discussed to further improve and manage the e-order fulfilment process.
Keyword:
E-order fulfilment
parallel scheduling
mixed integer programming
heuristic
depth-first
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Enhancing the order picking process through a new storage assignment strategy in forward-reserve area通过新的存储分配策略在远期储备区增强订单拣选流程
PREAI
分享收藏分享收藏
查看更多内容