Int. J. of Industrial and Systems Engineering   »   2010 Vol.6, No.4



Title: Exact and heuristic algorithms for inventory rationing in a divergent supply chain with order costs


Author: Brijesh Paul, Chandrasekharan Rajendran


Department of Management Studies, Indian Institute of Technology Madras, Chennai 600036, Tamil Nadu, India.
Department of Management Studies, Indian Institute of Technology Madras, Chennai 600036, Tamil Nadu, India


Abstract: This paper addresses the development of an inventory control mechanism and inventory rationing policies in a static divergent two-stage supply chain consisting of one single distributor and several retailers. The unsatisfied demand is assumed to be backlogged at both distributor's and retailers' ends. In the case of shortage at distributor, the available stock on hand is rationed among the retailers. Most of the studies in the literature treat ordering costs as negligible and assume the review period to be one unit of time. However, if there is a significant cost associated with the order placement, then the review period can be greater than one time unit. Hence, in this study, we consider ordering costs for retailers, and present a mathematical programming model which can give optimal base-stock levels and review periods and inventory rationing (in the class of periodic review, order-up-to S policy). A genetic algorithm-based heuristic algorithm is also presented for solving problems with a large time horizon.


Keywords: inventory rationing; base-stock levels; review periods; allocation rules; mathematical modelling; genetic algorithms; heuristic algorithms; order costs; divergent supply chains; two-stage supply chains; supply chain management; inventories; inventory control; distributors; retailers; unsatisfied demand; backlogs; shortages; available stocks; time units; order placements; periodic reviews; order-up-to S policies; time horizons.


DOI: 10.1504/IJISE.2010.035723


Int. J. of Industrial and Systems Engineering, 2010 Vol.6, No.4, pp.381 - 416


Available online: 03 Oct 2010



Editors Full text accessPurchase this articleComment on this article