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

被引:56
|
作者
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
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会;
关键词
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
相关论文
共 50 条
  • [1] A RULE-BASED HEURISTIC ALGORITHM FOR ON-LINE ORDER BATCHING AND SCHEDULING IN AN ORDER PICKING WAREHOUSE WITH MULTIPLE PICKERS
    Alipour, Mehrdad
    Mehrjedrdi, Yahia Zare
    Mostafaeipour, Ali
    RAIRO-OPERATIONS RESEARCH, 2020, 54 (01) : 101 - 117
  • [2] On-line Supply Chain Scheduling Problem with Capacity Limited Vehicles
    Han, B.
    Zhang, W. J.
    IFAC PAPERSONLINE, 2015, 48 (03): : 1539 - 1544
  • [3] On-line scheduling with forbidden zones
    Khammuang, K.
    Abdekhodaee, A.
    Wirth, A.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (01) : 80 - 90
  • [4] Algorithms for on-line order batching in an order picking warehouse
    Henn, Sebastian
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2549 - 2563
  • [5] Retail order picking scheduling with missing operations and limited buffer
    Souiden, Sawssen
    Cerqueus, Audrey
    Delorme, Xavier
    Rascle, Jean-Lucien
    IFAC PAPERSONLINE, 2020, 53 (02): : 10767 - 10772
  • [6] On-line deadline scheduling on multiple resources
    Kim, JH
    Chwa, KY
    COMPUTING AND COMBINATORICS, 2001, 2108 : 443 - 452
  • [7] On-line production order scheduling with preemption penalties
    Zheng, Feifeng
    Xu, Yinfeng
    Zhang, E.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 13 (02) : 189 - 204
  • [8] On-line production order scheduling with preemption penalties
    Feifeng Zheng
    Yinfeng Xu
    E. Zhang
    Journal of Combinatorial Optimization, 2007, 13 : 189 - 204
  • [9] On-line scheduling algorithms for a batch machine with finite capacity
    Poon, CK
    Yu, WC
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (02) : 167 - 186
  • [10] On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity
    Chung Keung Poon
    Wenci Yu
    Journal of Combinatorial Optimization, 2005, 9 : 167 - 186