A Single Item Lot Sizing with Backorder and a Finite Replenishment Rate in MRP
Total Page:16
File Type:pdf, Size:1020Kb
A Single Item Lot Sizing with Backorder and a Finite Replenishment Rate in MRP Liang Liang Yugang Yu School of Business, University of Science and Technology of China, Hefei Anhui 230026, China [email protected], [email protected] Hongying Wan Graduate School, University of Science and Technology of China, Hefei Anhui 230026, China Abstract the two basic hypotheses: fixed cost and infinite time horizon. In recent thirty years, many researches expanded There are the following characteristics in decision the application of economic order quantity equation by on lot size in material requirements planning (MRP) exceeding one or both of the two basic hypotheses. In systems: multiple time periods, a finite time horizon, 1972, Schwarz [17] suggested a model of EOQ with fixed discrete demand, and time-varying costs etc. In MRP cost and finite demand horizon. In 1967, 1982, 1985, B. system there are several different types of lot size Lev, Taylor [19] etc. presented respectively the EOQ techniques, such as the economic order quantity (EOQ), inventory model with one cost change and two time lot-for-lot, periodic order quantity, Wagner-Whitin horizons. B.Lev [11] concluded the results of former algorithm, Silver-Meal algorithm and part-period researches systematically and built a fluctuant EOQ algorithm. Although these lot size approaches focus on model with one cost change (increase or decrease) and controlling the cost of holding cost and order cost, none two time horizons (one finite time horizon adding one of them, with the exception of the Wagner-Whitin finite or infinite time horizon) in 1989. In 1990, B.Lev algorithm, assures an optimal or minimum cost solution and Zhang Jian [22] discussed the problem of EOQ for time-varying demand patterns and copes with inventory problem with the permission of two cost quantity discount. And Zangwill(1966), Blackburn and changes and three equal finite time horizons. And in 1997 Kunreuther (1974) et al extended the Wagner-Whitin Zhang Jian [23] discussed the same problems with algorithm by following demand to go unsatisfied during multiple time periods and multiple cost changes. Some of some period, provided it is satisfied eventually by these papers also discussed the backorder inventory production in some subsequent period. R. M. Hill (1997), problem in certain degree, and had important effect on Stanislaw Bylka, Ryszarda Rempala (2001) give the development of inventory theory. But some of the dynamic programming formulation to decide lot sizing assumptions such as continuous demand made in regard for a finite rate input process. But the Wagner-Whitin to classical inventory models (economic order quantity algorithm and its extensions commonly are criticized as (EOQ), economic production quantity (EPQ), and being difficult to explain and compute because the economic order interval (EOI)) are inappropriate for algorithms are complicated dynamic programming demand that varies from period to period. In this direction, algorithms. In this paper, we propose a series of the EOQ used in MRP ordering is to ignore the variation inventory models in which backorder and a finite and apply the EOQ formulation with an average demand replenishment rate are considered according to the rate. The indiscriminate use of these methods can result characteristics in MRP ordering and the optimal in larger than necessary inventory costs for these solutions can be obtained by using general-purpose conditions [15]. linear program solver, like EXCEL, LINDO, etc. The other research direction began with a different approach provided by Manne [14] and by Wagner and 1. Introduction Whitin [21] in 1958; they divided time into discrete periods and assumed that the demand in each period is It is important to decide the order quantities in the known in advance. Since 1958, the Manne-Wagner MRP system. MRP ordering has the features such as -Whitin model has received considerable attention, and multiple time periods, finite time horizon, time-varying several hundred papers have directly or indirectly costs according to the time periods, and discrete demand, discussed this model; most of these papers have either etc. There are two research directions to this practical extended this model or provided efficient algorithms for problem: one is the expansion of the classic inventory production problems that arise in it. The references given theory, such as EOQ model; the other gives models or here and those given by Bahl, Ritzman and Gupta [1] algorithms directly from the characteristics of the MRP provide only some of the papers related to the system. Manne-Wagner-Whitin model. Today, even an The first research direction focus on how to exceed introductory operations research textbook is likely to include a chapter on the Manne-Wagner -Whitin model production capacity or supply capacity from vendors and and on some of its extensions (See, for example, Johnson any interrupt between the replenishment incur setup cost. and Montgomery 1974 [10], Wagner 1975 [20], Denardo The order quantity may not satisfy the demand in 1982 [4], Richard J. Terine. 1988 [15], and Hax and time, and the shortages or stockouts are considered. But Candea 1984 [8].). Because of the immense interest in stockout in the end of the time horizon is prohibited. economic lot size models, a considerable amount of Items requirements in a period are withdrawn from research effort has been focused on establishing the inventory at the beginning of the period. Thus, the computational complexity of various economic lot size holding cost is applied to the end-of-period inventory and problems. (In particular, see Florian, Lenstra and is only applied to inventory held from one period to the Rinnooy Kan 1980 [6], Bitran and Yanasse 1982 [2], next. Items consumed during a period incur no holding Luss 1982 [13], Erickson, Monma and Veinott 1987 [5], cost. and Chung and Lin 1988 [3].). As the extensions of MRP is a rolling schedule and projected on hand Wagner-Whitin algorithm, Zangwill(1966), Blackburn being not zero is considered. and Kunreuther (1974) et al extended the Wagner-Whitin Suppose that there are I periods in MRP system, we algorithm by allowing demand to go unsatisfied during introduce the following problem parameters: some period, provided it is satisfied eventually by i={1,…,I},the index set of periods, production in some subsequent period [18]. R. M. Hill Ri = requirements in units for period i, (1997) [16], Stanislaw Bylka, Ryszarda Rempala (2001) OCi = fixed ordering cost or setup cost per order for [21] give dynamic programming formulation to decide lot period i, sizing for a finite rate input process. But the HCi = holding cost per unit for period i, Wagner-Whitin algorithm and it extensions commonly BCi =backorder cost of an item for period i, are criticized as being difficult to explain and compute S0=stock on hand for period 1 start or for period 0 because the algorithms are complicated dynamic end, programming algorithms. And many other non-optimal M=a sufficiently large number. algorithms, such as lot-for-lot, periodic order quantity, Pi = replenishment quantity if the replenishment for Silver-Meal algorithm and part-period algorithm occurred the whole period i is continued. [15, p161-178]. Decision Variables In this paper, we proposed the model that can obtain Xi = whether start to order or not (0-1 variables) for the economic lot size in MRP ordering systems with the ith period, backorder and a finite replenishment rate. Then, we Yi = whether to replenish or not (0-1 variables) for transfer the model into linear programming, and deduce the ith period, three other models, i.e., the model considering a finite Qi = lot size or replenish quantity for the ith period. time rate, the model considering backorder and the Zi = whether backorder or not (0-1 variables) for model in which backorder is prohibited and an infinite period i. replenishment rate. Finally, to illustrate the proposed The problem, denoted by RBP, is to solve: models we give a numerical example. Problem BDP: The models proposed in the paper permit order cost, Minimize TC= holding cost, backorder cost, price break points, and item prices varying from period to period. Comparing with Ii the Wagner-Whitin algorithm and it extensions, the ∑∑S+0 (QRjj−⋅−⋅−⋅ )[] (1 ZHCZBC i ) ii i+ ij==11 models are easier to explain and compute because the models are linearized or linear models and the optimal I I solutions of them can be obtained easily by using ∑ XOCii⋅ + ∑ PQ⋅ i (1) general-purpose linear program solver, like EXCEL, i=1 i=1 LINDO, etc. Subject to I S0+ ∑()QRii− ≥ 0 (2) 2. Mathematical model of the backorder and i=1 finite replenishment rate i SQRMZ0 +−≤⋅−∑()(1)jj i i=1,2,…,I, (3) Assumption: j=1 The planning horizon is finite and composed of i SQRMZ() i=1,2,…,I. (4) several time periods. 0 +−≥−⋅∑ jj i j =1 The demand is known and occurs at the beginning of QPY i=1、2…I (5) each period, but may change from one period from iii≤⋅ another. X1=Y1 (6) Lead-time is fixed. 、 … Yi1−≤⋅YMXii− i=2 3 I (7) Each time period is characterized by finite Q(1)(1)≥−⋅−PM Y −⋅− M Y i=1、2…I-1 (8) replenishment rate, which may be caused by a fixed i1ii+ i In BDP, the objective function, i.e. equation (1) is to i minimize the total inventory cost which include holding HQijji−−≥−⋅S+0 ∑( Q R ) M Z i=1,2,…,I, (12) j =1 cost and backorder cost over I time periods, i.e. Ii i ∑∑S+0 (QRjj−⋅−⋅−⋅ )[] (1 ZHCZBC i ) ii i, ordering BQijji+−≤⋅−S+0 ∑( Q R ) M (1 Z ) i=1,2,…,I, (13) ij==11 j=1 I i cost, i.e., ∑ XOCii⋅ , and item purchase cost, i.e., i=1 BQijji+−≥⋅−S+0 ∑( Q R ) M ( Z 1) i=1,2,…,I, (14) j=1 I ∑ PQ⋅ i .