清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

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

卡车 订单履行 备品备件 订单(交换) 调度(生产过程) 计算机科学 全渠道 地铁列车时刻表 订单处理 业务 运营管理 供应链 营销 操作系统 工程类 万维网 财务 航空航天工程
作者
Xueqi Wu,Zhi‐Long Chen
出处
期刊:Production and Operations Management [Wiley]
卷期号:31 (7): 2982-3003 被引量:8
标识
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
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Artin发布了新的文献求助50
48秒前
bkagyin应助baixun采纳,获得30
1分钟前
Artin发布了新的文献求助50
1分钟前
Artin完成签到,获得积分10
1分钟前
2分钟前
baixun发布了新的文献求助30
2分钟前
lkk183完成签到 ,获得积分10
2分钟前
Jasen完成签到 ,获得积分10
3分钟前
妇产科医生完成签到 ,获得积分10
4分钟前
方白秋完成签到,获得积分10
6分钟前
HuiHui完成签到,获得积分10
7分钟前
沙海沉戈完成签到,获得积分0
7分钟前
1437594843完成签到 ,获得积分10
7分钟前
poki完成签到 ,获得积分10
8分钟前
紫熊完成签到,获得积分10
9分钟前
xun完成签到,获得积分10
9分钟前
司马绮山完成签到,获得积分10
10分钟前
ww完成签到,获得积分10
10分钟前
Jerry完成签到,获得积分10
11分钟前
Ava应助Jerry采纳,获得10
11分钟前
ykswz99发布了新的文献求助30
11分钟前
mzhang2完成签到 ,获得积分10
13分钟前
13分钟前
Jerry发布了新的文献求助10
13分钟前
14分钟前
王木木发布了新的文献求助10
14分钟前
xiaogang127完成签到 ,获得积分10
14分钟前
Emperor完成签到 ,获得积分0
14分钟前
英俊的铭应助Omni采纳,获得10
15分钟前
宇文非笑完成签到 ,获得积分10
16分钟前
16分钟前
Omni发布了新的文献求助10
16分钟前
枯藤老柳树完成签到,获得积分10
18分钟前
19分钟前
Shicheng发布了新的文献求助10
20分钟前
隐形曼青应助Shicheng采纳,获得10
20分钟前
小加完成签到 ,获得积分10
20分钟前
现代完成签到,获得积分10
21分钟前
22分钟前
宝字盖完成签到,获得积分20
22分钟前
高分求助中
Sustainability in Tides Chemistry 2800
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
Rechtsphilosophie 1000
Bayesian Models of Cognition:Reverse Engineering the Mind 888
Le dégorgement réflexe des Acridiens 800
Defense against predation 800
XAFS for Everyone (2nd Edition) 600
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3134005
求助须知:如何正确求助?哪些是违规求助? 2784845
关于积分的说明 7768760
捐赠科研通 2440219
什么是DOI,文献DOI怎么找? 1297308
科研通“疑难数据库(出版商)”最低求助积分说明 624920
版权声明 600792