A dynamic lot sizing problem with multiple customers: customer-specific shipping and backlogging costs

This paper considers a dynamic lot sizing problem faced by a producer who supplies a single product to multiple customers. Characterized by their backorder costs as well as shipping costs, a customer with a high backorder cost has a greater need for the product than a customer with a low backorder cost. We show that the general problem with time-varying customer-dependent backlogging and shipping costs is NP-hard in the strong sense. We then develop an efficient dynamic programming algorithm for an important instance of the problem when there is no speculative motive for backlogging. We also establish forecast horizon results for the case of stationary production and shipping costs, which help the decision maker determine a proper forecast horizon in a rolling-horizon planning process.

[1]  R. Roundy.  98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems , 1985 .

[2]  H. Kunreuther,et al.  Planning Horizons for the Dynamic Lot Size Model with Backlogging , 1974 .

[3]  Suresh P. Sethi,et al.  Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography , 2001, Manuf. Serv. Oper. Manag..

[4]  Lap Mui Ann Chan,et al.  On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures , 2002, Oper. Res..

[5]  Awi Federgruen,et al.  The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions , 1994, Oper. Res..

[6]  Zvi Galil,et al.  A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming , 1990, Inf. Process. Lett..

[7]  Chung-Lun Li,et al.  Dynamic Lot Sizing with Batch Ordering and Truckload Discounts , 2004, Oper. Res..

[8]  Karen Donohue,et al.  A Threshold Inventory Rationing Policy for Service - Differentiated Demand Classes , 2003, Manag. Sci..

[9]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[10]  T. Morton.  Note—An Improved Algorithm for the Stationary Cost Dynamic Lot Size Model with Backlogging , 1978 .

[11]  V. Hsu.  Dynamic Economic Lot Size Model with Perishable Inventory , 2000 .

[12]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[13]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[14]  Karen Donohue,et al.  An Empirical Study of Service Differentiation for Weapon System Service Parts , 2003, Oper. Res..

[15]  Robin O. Roundy,et al.  Planning Shipping Intervals in Multi-Item, One-Warehouse, Multi-Retailer Distribution Systems , 1987 .

[16]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[17]  AWI FEDERGRUEN.  THE JOINT REPLENISHMENT PROBLEM WITH TIME-VARYING COSTS AND DEMANDS : EFFICIENT , ASYMPTOTIC AND E-OPTIMAL SOLUTIONS AWI FEDERGRUEN , 2008 .

[18]  R. Dekker,et al.  An Overview of Inventory Systems with Several Demand Classes , 1999 .

[19]  E. Arkin,et al.  Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .