Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures

被引:110
作者
Chan, LMA [1 ]
Muriel, A
Shen, ZJM
Simchi-Levi, D
Teo, CP
机构
[1] Univ Toronto, Sch Management, Toronto, ON, Canada
[2] Univ Massachusetts, Dept Mech & Ind Engn, Amherst, MA 01003 USA
[3] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL USA
[4] MIT, Engn Syst Div, Cambridge, MA 02139 USA
[5] MIT, Dept Civil & Environm Engn, Cambridge, MA 02139 USA
[6] Natl Univ Singapore, Dept Decis Sci, Singapore 117548, Singapore
关键词
approximation algorithms; zero-inventory-ordering policies; inventory; transportation; Truckload (TL); Less than Truckload (LTL);
D O I
10.1287/mnsc.48.11.1446.267
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We analyze the problem faced by companies that rely on TL (Truckload) and LTL (Less than Truckload) carriers for the distribution of products across their supply chain. Our goal is to design simple inventory policies and transportation strategies to satisfy time-varying demands over a finite horizon, while minimizing systemwide cost by taking advantage of quantity discounts in the transportation cost structures. For this purpose, we study the cost effectiveness of restricting the inventory policies to the class of zero-inventory-ordering (ZIO) policies in a single-warehouse multiretailer scenario in which the warehouse serves as a cross-dock facility. In particular, we demonstrate that there exists a ZIO inventory policy whose total inventory and transportation cost is no more than 4/3 (5.6/4.6 if transportation costs are stationary) times the optimal cost. However, finding the best ZIO policy is an NP-hard problem as well. Thus, we propose two algorithms to find an effective ZIO policy: An exact algorithm whose running time is polynomial for any fixed number of retailers, and a linear-programming-based heuristic whose effectiveness is demonstrated in a series of computational experiments. Finally, we extend the worst-case results developed in this paper to systems in which the warehouse does hold inventory.
引用
收藏
页码:1446 / 1460
页数:15
相关论文
共 7 条
[1]   COMPUTATIONAL-COMPLEXITY OF UNCAPACITATED MULTI-ECHELON PRODUCTION PLANNING PROBLEMS [J].
ARKIN, E ;
JONEJA, D ;
ROUNDY, R .
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :61-66
[2]  
ARORA S, 1997, P 29 ANN ACM S THEOR, P485
[3]  
CHAN LMA, 1999, IN PRESS OPER RES
[4]  
CHAN LMA, 1999, PRODUCTION DISTRIBUT
[5]  
Cormen TH, 1999, INTRO ALGORITHMS
[6]   A threshold of in n for approximating set cover [J].
Feige, U .
JOURNAL OF THE ACM, 1998, 45 (04) :634-652
[7]   THE JOINT REPLENISHMENT PROBLEM - NEW HEURISTICS AND WORST CASE PERFORMANCE BOUNDS [J].
JONEJA, D .
OPERATIONS RESEARCH, 1990, 38 (04) :711-723