Fulfillment scheduling for buy‐online‐pickup‐in‐store orders

卡车 订单履行 备品备件 订单(交换) 调度(生产过程) 计算机科学 全渠道 地铁列车时刻表 订单处理 业务 运营管理 供应链 营销 操作系统 工程类 万维网 航空航天工程 财务
作者
Xueqi Wu,Zhi‐Long Chen
出处
期刊:Production and Operations Management [Wiley]
卷期号:31 (7): 2982-3003 被引量:11
标识
DOI:10.1111/poms.13734
摘要

One of the most popular ways of shopping in an omnichannel retailing environment is buy‐online‐pickup‐in‐store (BOPS). Retailers often promise BOPS shoppers short in‐store pickup ready times. We study fulfillment scheduling decisions of BOPS orders destined for a single store of a retailer. There are two fulfillment options for BOPS orders: they can be either processed at a fulfillment center (FC) and delivered to the store or processed at the store without needing delivery. There are two types of trucks available to deliver the BOPS orders fulfilled at the FC: prescheduled trucks that are already committed to replenishing store inventory and have some spare capacity that can be utilized, and additional trucks that can be hired from third‐party logistics providers. There is a fixed cost for using each truck; the cost for using a prescheduled truck is lower than that for using an additional truck. If an order is fulfilled at the store, it incurs a processing cost and a processing time, whereas the processing cost and time are negligible if an order is fulfilled at the FC. The problem is to determine where to fulfill each order (FC vs. the store), how to assign the orders fulfilled at the FC to trucks for delivery, and how to schedule the orders fulfilled at the store for store processing, so as to minimize the total fulfillment cost, including the delivery cost from the FC to the store incurred by the orders processed at the FC, and the processing cost for fulfilling the rest of the orders at the store, subject to the constraint that each order is ready for pickup at the store by its promised pickup ready time. We consider various cases of the problem by clarifying their computational complexity, developing optimal algorithms and heuristics, and analyzing theoretical performance of the heuristics. We also conduct computational experiments to validate the effectiveness of the proposed heuristics in both static and dynamic settings and derive important insights about how the presence of prescheduled trucks and the presence of store fulfillment option impact the fulfillment cost and decisions.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
清脆飞机完成签到,获得积分10
1秒前
量子星尘发布了新的文献求助10
2秒前
3秒前
4秒前
ukmy发布了新的文献求助10
5秒前
5秒前
自信书文发布了新的文献求助10
6秒前
hy完成签到 ,获得积分10
6秒前
ljw发布了新的文献求助10
9秒前
研友_Zeg3VL完成签到,获得积分10
9秒前
满意的尔蝶完成签到,获得积分10
10秒前
SciGPT应助与非采纳,获得10
11秒前
无花果应助vvvv采纳,获得10
11秒前
小蘑菇应助杏花饼采纳,获得10
11秒前
12秒前
qs完成签到,获得积分10
14秒前
李健应助en采纳,获得10
14秒前
脑洞疼应助自信书文采纳,获得10
14秒前
星辰大海应助满意的尔蝶采纳,获得10
15秒前
赘婿应助绿大暗采纳,获得30
15秒前
15秒前
李爱国应助ukmy采纳,获得10
15秒前
16秒前
lll发布了新的文献求助10
17秒前
17秒前
热心市民小红花应助名天采纳,获得50
18秒前
淡然棒球完成签到 ,获得积分10
19秒前
19秒前
21秒前
一碗笋汤发布了新的文献求助10
21秒前
CipherSage应助<小天才>采纳,获得10
21秒前
yingliusd发布了新的文献求助10
21秒前
22秒前
22秒前
shi发布了新的文献求助10
22秒前
23秒前
24秒前
Ethan发布了新的文献求助10
24秒前
24秒前
24秒前
高分求助中
The Mother of All Tableaux Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 2400
Ophthalmic Equipment Market by Devices(surgical: vitreorentinal,IOLs,OVDs,contact lens,RGP lens,backflush,diagnostic&monitoring:OCT,actorefractor,keratometer,tonometer,ophthalmoscpe,OVD), End User,Buying Criteria-Global Forecast to2029 2000
A new approach to the extrapolation of accelerated life test data 1000
Cognitive Neuroscience: The Biology of the Mind 1000
Cognitive Neuroscience: The Biology of the Mind (Sixth Edition) 1000
Optimal Transport: A Comprehensive Introduction to Modeling, Analysis, Simulation, Applications 800
Official Methods of Analysis of AOAC INTERNATIONAL 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3959733
求助须知:如何正确求助?哪些是违规求助? 3506004
关于积分的说明 11127299
捐赠科研通 3237957
什么是DOI,文献DOI怎么找? 1789411
邀请新用户注册赠送积分活动 871741
科研通“疑难数据库(出版商)”最低求助积分说明 803000