期刊
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
卷 11, 期 2, 页码 340-355出版社
INFORMS
DOI: 10.1287/msom.1080.0222
关键词
online retailing; online order fulfillment; local search heuristics
资金
- MIT Leaders for Manufacturing Program
- MIT and major manufacturing firms
- Singapore-MIT Alliance
- National University of Singapore, Nanyang Technological University, and MIT
When a customer orders online, an online retailer assigns the order to one or more of its warehouses and/or drop-shippers to minimize procurement and transportation costs based on the available current information. However, this assignment is necessarily myopic because it cannot account for any subsequent customer orders or future inventory replenishment. We examine the benefits of periodically reevaluating these real-time assignments. We construct near-optimal heuristics for the reassignment for a large set of customer orders to minimize the total number of shipments. Finally, we present evidence of significant saving opportunities by testing the heuristics on order data from a major online retailer.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据