已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

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

卡车 订单履行 备品备件 订单(交换) 调度(生产过程) 计算机科学 全渠道 地铁列车时刻表 订单处理 业务 运营管理 供应链 营销 操作系统 工程类 万维网 财务 航空航天工程
作者
Xueqi Wu,Zhi‐Long Chen
出处
期刊:Production and Operations Management [Wiley]
卷期号:31 (7): 2982-3003 被引量:15
标识
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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
研友_VZG7GZ应助呼斯冷采纳,获得10
1秒前
GQC发布了新的文献求助10
1秒前
455发布了新的文献求助10
3秒前
3秒前
cyy发布了新的文献求助10
3秒前
3秒前
乔凌云发布了新的文献求助10
4秒前
4秒前
所所应助Morii采纳,获得10
4秒前
天宇南神完成签到 ,获得积分10
4秒前
xiaomeng完成签到 ,获得积分10
5秒前
6秒前
和abc发布了新的文献求助10
6秒前
EadonChen发布了新的文献求助10
7秒前
机灵的忆梅完成签到 ,获得积分10
8秒前
8秒前
Bosen发布了新的文献求助30
8秒前
科研通AI6.1应助调皮飞雪采纳,获得10
10秒前
11秒前
611发布了新的文献求助10
12秒前
12秒前
13秒前
13秒前
木蝴蝶发布了新的文献求助10
13秒前
13秒前
scanker1981完成签到,获得积分10
14秒前
123姚完成签到,获得积分10
14秒前
Zer应助自然卷卷卷采纳,获得10
14秒前
冷艳的纸鹤完成签到,获得积分10
15秒前
15秒前
Hello应助闪闪的绿兰采纳,获得10
15秒前
呼斯冷发布了新的文献求助10
16秒前
fancy完成签到,获得积分10
16秒前
黄123huang_完成签到,获得积分10
17秒前
18秒前
情怀应助心灵美灵波采纳,获得30
18秒前
swallow发布了新的文献求助10
18秒前
smart发布了新的文献求助10
20秒前
20秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Introduction to strong mixing conditions volume 1-3 5000
Agyptische Geschichte der 21.30. Dynastie 3000
Aerospace Engineering Education During the First Century of Flight 2000
„Semitische Wissenschaften“? 1510
从k到英国情人 1500
sQUIZ your knowledge: Multiple progressive erythematous plaques and nodules in an elderly man 1000
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5771695
求助须知:如何正确求助?哪些是违规求助? 5593329
关于积分的说明 15428228
捐赠科研通 4904978
什么是DOI,文献DOI怎么找? 2639147
邀请新用户注册赠送积分活动 1587032
关于科研通互助平台的介绍 1541938