Two-phase algorithm for the lot-sizing problem with backlogging for stepwise transportation cost without speculative motives

In this paper we consider the lot-sizing problem with backlogging under stepwise transportation costs. Inventory is carried over or backlogged in a trade-off with costs for production setup and transportation. Specifically, inventory is the main source for consolidating demand over periods to increase the chance of Full-Truck-Load (FTL) delivery. We assume that there are no speculative motives in production, which yields an important property for Less-Than-Load (LTL) delivery that the LTL cargo does not contain any unit carried over from the previous period or backlogged for the next period. We solve the problem in two phases. In phase one, we use a geometric technique to preprocess necessary functional values for FTL delivery. In phase two, we provide a residual zoning algorithm, involving not only FTL delivery but also LTL delivery, to obtain an optimal solution. The computational complexity is shown to be O(T2logT) where T is the length of the planning horizon.

[1]  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..

[2]  Apm Wagelmans,et al.  Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions , 1994 .

[3]  Willard I. Zangwill,et al.  A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..

[4]  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 .

[5]  Arunachalam Narayanan,et al.  Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms , 2009 .

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

[7]  Christophe Rapine,et al.  Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost , 2012, Oper. Res. Lett..

[8]  Haoxun Chen,et al.  Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems , 2015 .

[9]  Chung-Yee Lee,et al.  A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse , 2003, Oper. Res..

[10]  Chien-Hua M. Lin,et al.  An OT2 Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem , 1988 .

[11]  Hark-Chin Hwang,et al.  Economic Lot-Sizing for Integrated Production and Transportation , 2010, Oper. Res..

[12]  S. Lippman.  Optimal inventory policy with multiple set-up costs , 1968 .

[13]  Chung-Yee Lee.  A solution to the multiple set-up problem with dynamic demand , 1989 .

[14]  Albert P. M. Wagelmans,et al.  An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .

[15]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[16]  Mathieu Van Vyve.  Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size , 2007, Math. Oper. Res..

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

[18]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[19]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[20]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

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