APPROXIMATION PROCEDURES FOR THE ONE-WAREHOUSE MULTIRETAILER SYSTEM

作     者：LU, L POSNER, ME 

作者机构：OHIO STATE UNIVDEPT IND & SYST ENGNCOLUMBUSOH 43210 USA 

出 版 物：《MANAGEMENT SCIENCE》 (管理科学)

年 卷 期：1994年第40卷第10期

页      面：1305-1316页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

主　　题：ONE-WAREHOUSE MULTIRETAILER SYSTEM RELATIVE ERROR FULLY POLYNOMIAL-TIME APPROXIMATION SCHEME 

摘      要：Two heuristic procedures for a one-warehouse multi-retailer system are developed. Based on the accuracy desired, the first heuristic evaluates a specified number of points. The relative error is within a bound that approaches 1/(root 2 In 2) - 1 approximate to 2.014%. The complexity of the heuristic is O(n) for a fixed number of evaluations. Although our bound only approaches the one of Roundy (1985), when only a small number of points are evaluated, our method is faster. We show that the bound for our procedure and two bounds proposed by Roundy (1985) are tight. The second heuristic pertains to a class of policies called stationary interval policies. For this class of policies, we develop a fully polynomial-time approximation scheme where the relative error is within epsilon 0, and the computational effort increases as a linear function of 1/root epsilon. Computational experiments show that these heuristics perform well in practice.