Journal
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
Volume 11, Issue 2, Pages 340-355Publisher
INFORMS
DOI: 10.1287/msom.1080.0222
Keywords
online retailing; online order fulfillment; local search heuristics
Funding
- MIT Leaders for Manufacturing Program
- MIT and major manufacturing firms
- Singapore-MIT Alliance
- National University of Singapore, Nanyang Technological University, and MIT
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available