A dynamic model for serial supply chain with periodic delivery policy

A three-echelon, dynamic lot-sizing model is presented for computing the parameters of a serial supply chain, which consists of integrated material replenishment, production at a capacity constraint, and outbound dispatching with a periodic delivery policy. The model is applicable in the general context of a three-echelon model with capacity constraint at the middle echelon of the serial supply chain which was not considered in most of the literature. This paper addresses a number of structural properties of the model and proposes a polynomial-time algorithm for deriving the optimal solution of minimising the total system costs over the planning horizon. Examples are provided to describe the algorithm.

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

[2]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

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

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

[5]  Philip M. Kaminsky,et al.  Production and Distribution Lot Sizing in a Two Stage Supply Chain , 2003 .

[6]  R. Ibrahim,et al.  Joint economic lot size in distribution system with multiple shipment policy , 2006 .

[7]  Ruhul A. Sarker,et al.  An optimal batch size for a production system operating under periodic delivery policy , 1999 .

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

[9]  Albert P. M. Wagelmans,et al.  Integrated Lot Sizing in Serial Supply Chains with Production Capacities , 2005, Manag. Sci..

[10]  Gyana R. Parija,et al.  An Optimal Batch Size for a Production System Operating Under a Fixed-Quantity, Periodic Delivery Policy , 1994 .

[11]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[12]  Xiaofei Xu,et al.  INCORPORATING TRANSPORTATION COSTS INTO JIT LOT SPLITTING DECISIONS FOR COORDINATED SUPPLY CHAINS , 2006 .

[13]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[14]  Ruhul A. Sarker,et al.  An optimal batch size under a periodic delivery policy , 2001, Int. J. Syst. Sci..