亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Maisie完成签到,获得积分10
刚刚
shier完成签到,获得积分20
刚刚
平心定气完成签到 ,获得积分10
1秒前
shier发布了新的文献求助10
3秒前
Maisie发布了新的文献求助30
3秒前
7秒前
zzl发布了新的文献求助10
11秒前
candy teen完成签到,获得积分10
14秒前
勤奋苑睐完成签到,获得积分10
15秒前
周周粥完成签到 ,获得积分10
17秒前
20秒前
王世缘完成签到,获得积分10
22秒前
23秒前
AQI发布了新的文献求助10
27秒前
愉快的犀牛完成签到 ,获得积分10
27秒前
29秒前
欣怡发布了新的文献求助10
29秒前
32秒前
研友_VZG7GZ应助临河盗龙采纳,获得10
32秒前
ppwq完成签到 ,获得积分10
32秒前
隐形曼青应助蓝天下载采纳,获得10
32秒前
35秒前
36秒前
36秒前
36秒前
笑傲完成签到,获得积分10
36秒前
DD发布了新的文献求助10
38秒前
白告发布了新的文献求助10
38秒前
共享精神应助科研通管家采纳,获得10
39秒前
科研通AI6应助科研通管家采纳,获得10
39秒前
科研通AI6应助科研通管家采纳,获得10
39秒前
完美世界应助科研通管家采纳,获得10
39秒前
上官若男应助科研通管家采纳,获得10
39秒前
Akim应助zzl采纳,获得10
40秒前
小耳朵发布了新的文献求助10
40秒前
muuuu发布了新的文献求助30
42秒前
45秒前
LK完成签到,获得积分10
48秒前
Orange应助DD采纳,获得10
50秒前
李爱国应助小耳朵采纳,获得10
57秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Introduction to strong mixing conditions volume 1-3 5000
Agyptische Geschichte der 21.30. Dynastie 3000
Les Mantodea de guyane 2000
„Semitische Wissenschaften“? 1510
从k到英国情人 1500
Cummings Otolaryngology Head and Neck Surgery 8th Edition 800
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5754595
求助须知:如何正确求助?哪些是违规求助? 5487917
关于积分的说明 15380281
捐赠科研通 4893160
什么是DOI,文献DOI怎么找? 2631746
邀请新用户注册赠送积分活动 1579693
关于科研通互助平台的介绍 1535417