On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity

被引:57
作者
Zhang, Jun [1 ]
Wang, Xuping [2 ,3 ]
Huang, Kai [4 ]
机构
[1] Cent China Normal Univ, Informat Management Dept, Wuhan 430079, Hubei, Peoples R China
[2] Dalian Univ Technol, Inst Syst Engn, Dalian 116023, Peoples R China
[3] Dalian Univ Technol, Sch Business, Panjin 124221, Peoples R China
[4] McMaster Univ, DeGroote Sch Business, Hamilton, ON L8S 4L8, Canada
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2018年 / 79卷
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会;
关键词
Integrated order picking and delivery; On-line scheduling; Competitive analysis; Multiple delivery zones; Vehicle capacity; INTEGRATED PRODUCTION; TRAVEL-TIME; RECTANGULAR WAREHOUSE; BATCH MACHINE; ALGORITHMS; TRANSPORTATION; MAKESPAN; MINIMIZE;
D O I
10.1016/j.omega.2017.08.004
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the on-line business-to-customer (B2C) e-commerce supply chain scheduling problem where customers generate orders on-line that have to be picked from the shelves in a warehouse and delivered to the customers in different zones. The problem is identified as a specific integrated production-delivery problem, named on-line order picking and delivery problem with multiple delivery zones and limited vehicle capacity. The orders are grouped into batches and delivered to their assigned zones by the capacitated vehicles. The objective is to minimize the total cost, which is the sum of the makespan and the delivery cost. We present an on-line 4-competitive algorithm by integrating the existing methods for the on-line integrated production-delivery problem, the on-line batching machine problem, and the on-line order batching problem. Our extensive numerical experiments show that the proposed algorithm is robust and efficient. Moreover, through the comparison with the benchmark, it is demonstrated that the proposed model can lead to a substantial reduction of both the total cost and the delivery cost. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:104 / 115
页数:12
相关论文
共 40 条
[1]   On-line supply chain scheduling problems with preemption [J].
Averbakh, Igor ;
Xue, Zhihui .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) :500-504
[2]   Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem [J].
Averbakh, Igor ;
Baysan, Mehmet .
OPERATIONS RESEARCH LETTERS, 2013, 41 (06) :710-714
[3]   On-line integrated production-distribution scheduling problems with capacitated deliveries [J].
Averbakh, Igor .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (02) :377-384
[4]  
Brucker P., 1998, Journal of Scheduling, V1, P31, DOI 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO
[5]  
2-R
[6]   Optimizing a dynamic order-picking process [J].
Bukchin, Yossi ;
Khmelnitsky, Eugene ;
Yakuel, Pini .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (02) :335-346
[7]   Logistics scheduling with batching and transportation [J].
Chen, Bo ;
Lee, Chung-Yee .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) :871-876
[8]   An association-based clustering approach to order batching considering customer demand patterns [J].
Chen, MC ;
Wu, HP .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2005, 33 (04) :333-343
[9]   Integrated Production and Outbound Distribution Scheduling: Review and Extensions [J].
Chen, Zhi-Long .
OPERATIONS RESEARCH, 2010, 58 (01) :130-148
[10]  
Cheng B., 2015, Int. J. Syst. Sci., V2, P78