Abstract
This paper presents a production-inventory model for deteriorating items with stock-dependent demand under inflation in a random planning horizon. The supplier offers the retailer fully permissible delay in payment. It is assumed that the time horizon of the business period is random in nature and follows exponential distribution with a known mean. Here learning effect is also introduced for the production cost and setup cost. The model is formulated as profit maximization problem with respect to the retailer and solved with the help of genetic algorithm (GA) and PSO. Moreover, the convergence of two methods—GA and PSO—is studied against generation numbers and it is seen that GA converges rapidly than PSO. The optimum results from methods are compared both numerically and graphically. It is observed that the performance of GA is marginally better than PSO. We have provided some numerical examples and some sensitivity analyses to illustrate the model.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction
In the present competitive market, the supplier influences the customers in many different ways to capture the market. For this reason, they offer a delay period in payment without any extra charges. The wholesaler allows a time period after which retailers are to make the payment without paying any interest. But after the delay period, if it is not payed, an interest charged for the rest of the period. Goyal (1985) first established a single-item inventory model under permissible delay in payment. Later many researchers worked in this area. Chang et al. (2003) and Chung and Liao (2004) dealt with the problem of determining the EOQ for exponentially deteriorating items under permissible delay in payment. Das et al. (2010a, b) presented an EPQ model for deteriorating items under permissible delay in payment. Teng et al. (2011) developed an EOQ model for stock-dependent demand under supplier’s trade credit offer with a progressive payment scheme. Min et al. (2012) developed an EPQ model with inventory-level-dependent demand and permissible delay in payment. Recently, Ouyang and Chang (2013) proposed an optimal production lot with imperfect production process under permission delay in payment and complete backlogging
Now—a—days, there is a stiff competition amongst the multi-nationals to influence the customers and to capture the market. Thus, in the recent competitive market, the inventory stock is decoratively exhibited and displayed through electronic media to attract the customers and thus to boost the sale. For this reason, a group of researchers have considered inventory control systems with stock-dependent demand in their research such as Datta and Pal (1992), Mandal and Phaujdar (1989a, b), Giri et al. (1996), Hou (2006), Roy et al. (2009a), and others. They considered linear form of stock-dependent demand.
Production cost of a manufacturing system depends upon the combination of different production factors. These factors are (a) raw materials, (b) technical knowledge, (c) production procedure, (d) firm size, (e) quantity of product, and so on. Normally, the cost of raw materials is imprecise in nature. So far, cost of technical knowledge, that is labor cost, has been usually assumed to be constant. However, as the employees perform the same task repeatedly, they learn how to provide repeatedly a standard level of performance efficiently. Therefore, the processing cost per unit product decreases in every cycle. Similarly, a part of the ordering cost may also decrease in every cycle. In the inventory control literature, this phenomenon is known as the learning effect. Although different types of learning effects in various areas have been studied (cf. Chiu and Chen 2005, Kuo and Yang 2006, Alamri and Balkhi 2007, etc.), it has rarely been studied in the context of inventory control problems.
Classical inventory models are usually developed over the infinite planning horizon. According to Gurnani (1985) and Chung and Kim (1989), the assumption of infinite planning horizon is not realistic due to several reasons such as variation of inventory costs, change in product specifications and designs, technological changes, etc. Moreover, for seasonal products like fruits, vegetables, warm garments, etc., business period is not infinite, rather fluctuates with each season. Hence, the planning horizon for seasonal products varies over years and may be considered as random with a distribution. Moon and Yun (1993) developed an EOQ model with the random planning horizon. Also Das et al. (2010a, b) presented an EPQ model with inflation random product life cycle. Till now, none has developed EPQ models considering the delay in payment under random planing horizon. Table 1 represents the summary of related literature for inventory models with random planning horizon.
Taking the above shortcomings into account, this paper presents some EPQ models for a deteriorating item considering delay in payment and linearly stock-dependent demand with a random planing horizon, that is, the life time of the product is assumed as random in nature and follows an exponential distribution with a known mean. Learning effect in setup cost and production cost is introduced, i.e., setup cost and production cost reduce successively with each cycle. Interest earned and interest paid vary with the permitted fixed period of permissible delay offered by the wholesaler. The model is formulated as a profit maximization problem and solved using Genetic Algorithm. The model is illustrated with numerical examples and some sensitivity analyses are performed.
In addition to the above considerations, the rest of the article is organized as follows. Section “Notations and assumptions” presents assumptions and notations that are used throughout this article. Section “Mathematical formulation” formulates a mathematical model in order to maximize the total profit of the retailer. Two different solution procedures (GA and PSO) are discussed in Sect. “Solution procedure”. In Sect. “Numerical example and sensitivity analysis,” several numerical examples are given to illustrate the solution procedure and sensitivity analyses are performed. The paper is concluded in Sect. “Conclusion and future scope.” Finally the managerial insights are presented in Sect. “Managerial insights.”
Notations and assumptions
The mathematical model of the proposed production-inventory problem is developed based on the following assumptions and notations :
Assumptions
-
1.
Demand rate is stock dependent.
-
2.
Time horizon is random.
-
3.
Time horizon accommodates first N cycles and ends during (N + 1) cycles.
-
4.
Setup time is negligible.
-
5.
Production rate is known and constant.
-
6.
Shortages are not allowed.
-
7.
A constant fraction of on-hand inventory gets deteriorated per unit time.
-
8.
Lead time is zero.
-
9.
Production cost and setup cost decrease due to the learning effect.
Notations
The following notations have been used throughout this paper:
N \(=\) Number of fully accommodated cycles to be made during the prescribed time horizon.
q(t) \(=\) On-hand inventory of a cycle at time t,\((j-1)T \le t \le jT\) (j \(=\) 1,2,...,N).
\(t_{1}\) \(=\) Production period in each cycle.
P \(=\) Production rate in each cycle.
D \(=\) Demand rate in each cycle \(=\) \(\alpha +\beta q(t)\).
\(C_{1}\) \(=\) Holding cost per unit item per unit time.
\(C_{3}^j=\,\) \(\,C_3+C_3^{'}e^{-\delta _{j}}\) is setup cost in j-th (\(j = 1,2,\ldots ,N\)) cycle, \(\delta >0\) (\(\delta\) is the learning coefficient associated with setup cost).
\(p_{0} e^{-\gamma _{j}}\) \(=\) Production cost in j-th \((j = 1,2,\ldots ,N)\) cycle, \(p_{0}, \gamma >\) 0 (\(\gamma\) is the learning coefficient associated with production cost).
\(m_{0} p_{0} e^{-\gamma _{j}}\) \(=\) Selling price in j-th (\(j=1,2,\ldots ,N\)) cycle, \(p_{0}, \gamma >\) 0, \(m_{0}>1\).
\(I_{c}\) \(=\) Interest charged per dollar per unit time.
\(I_{e}\) \(=\) Interest earned per dollar per unit time.
M \(=\) The period of cash discount for which the supplier does not charge any interest.
T \(=\) Duration of a complete cycle.
i \(=\) Inflation rate.
r \(=\) Discount rate.
R \(=\) \(r-i\), the net discount rate of inflation is constant.
P(N, T) \(=\) Total profit after completing N fully accommodated cycles.
H \(=\) Total time horizon (a random variable) and h is the real time horizon.
\(m_{1} p_{0} e^{-\gamma (N+1)}\) \(=\) Reduced selling price for the inventory items in the last cycle at the end of time horizon, \(p_{0}, \gamma >\) 0, \(m_{1}<1\).
\(\theta\) \(=\) Deterioration rate of the produced item.
\(E_{k}\{P(N,T)\}\) \(=\) Expected total profit from N complete cycles in k-th case, \(k=1,2\).
\(E_{k}\{TP_{L}(T)\}\) \(=\) Expected total profit from last cycle in k-th case, \(k=1,2\).
\(E_{k}\{TP(T)\}\) \(=\) Expected total profit from the planning horizon in k-th case, \(k=1,2\).
Mathematical formulation
In this section, we formulate a production-inventory model for deteriorating items under inflation over a random planning horizon incorporating learning effect using permissible delay period. Here it is assumed that there are N full cycles during the real-time horizon h and the planning horizon ends within \((N+1){\mathrm{th}}\) cycle, i.e., between the time \(t = NT\) and \(t =(N+1)T\). At the beginning of every \(j{\mathrm{th}}\) \((j = 1,2, \ldots ,{\textit{N}}+1)\) cycle, production starts at \(t = (j-1)T\) and continues up to \(t =(j-1)T + t_1\), and inventory gradually increases after meeting the demand due to production. Production thus stops at \(t=(j-1)T + t_1\) and the inventory falls to zero level at the end of the cycle time \(t = jT\), due to deterioration and consumption. The retailer pays the payment at time period M without any interest. At the end of this period, he/she starts paying for the interest charged on the items in stocks. Also during the time, the account is not settled, and generated sales revenue is deposited in an interest bearing account. This cycle repeats again and again. For the last cycle, some amounts may be left after the end of planning horizon. This amount is sold at a reduced price in a lot. Regarding the interest payed and interest earned based on the length of the \(j{\mathrm{th}}(1\le j\le N)\) cycle time T, two different cases may arise:
-
Case 1: \((j-1)T+M\le (j-1)T+t_{1}\le jT\)
-
Case 2: \((j-1)T+t_{1}\le (j-1)T+M\le jT\)
Again for last cycle, according to the values of M, T, and \(t_{1}\), we have three different subcases for each case, which are pictorially depicted in Figs.1a, b, c, 2a, b, c, respectively. We discuss the detailed formulations in each subcases.
Here, it is assumed that the planning horizon H is a random variable and follows exponential distribution with probability density function (p.d.f) as
Formulation for N full cycles
The differential equations describing the inventory level q(t) in the interval \((j-1)T \le t \le jT(1\le j \le N)\), \(j=1, 2, \ldots ,{\textit{N}}\) are given by
where \(P>0\), \(\alpha >0\), \(\beta >0\), \(\theta >0\) , and 0 \(<t_{1}<T\), subject to the conditions that \(q(t)=0\) at \(t=(j-1)T\), and \(q(t)=0\) at \(t=jT\).
The solutions of the differential equations in (2) are given by
Now at \(t =(j-1)T+t_{1}\), from (3) we get,
Expected total profit from N full cycles
From the symmetry of every full cycle, present value of the expected total profit from N full cycles, \(E_{k}\{P(N,T)\}\) in \(k{\mathrm{th}}( k = 1,2)\) case is given by
where ESRN, \({\mathrm{EI}}_{k}{\mathrm{EN}}\), EPCN, EHCN, ETOCN, and \({\mathrm{EI}}_{k}{\mathrm{PN}}\) are present values of expected total sales revenue, expected total interest earned, expected total production cost, expected holding cost, expected total ordering cost, and expected total interest paid, respectively, from N full cycles and their expressions are derived in Appendix 1 [see equations (22), (25), (31), (16), (13), (19), (28), (34), respectively].
Formulation for last cycle
Duration of the last cycle is [NT, h], where h is the real-time horizon corresponding to the random time horizon H.
Here two different cases may arise depending upon the last cycle length.
-
Case-I: \(NT < h \le NT+t_{1}\) and
-
Case-II: \(NT+t_{1} < h \le (N+1)T\).
The differential equations describing the inventory level q(t) in the interval \(NT < t \le h\) are given by
subject to the conditions that,
The solutions of the differential equations in (6) are given by
Expected total profit from last cycle
Present value of expected total profit from last cycle, \(E_{k}\{{\mathrm{TP}}_{L}(T)\}\), in \(k{\mathrm{th}}( k=1,2)\) case is given by
where \({\mathrm{ESR}}_{L}, {\mathrm{ERSP}}_{L}, {\mathrm{EI}}_{k}E_{L}, {\mathrm{EHC}}_{L}, {\mathrm{EPC}}_{L}, {\mathrm{EOC}}_{L}, {\mathrm{EI}}_{k}P_{L}\) are present values of expected sales revenue, expected reduced selling price, expected interest earned, expected holding cost, expected production cost, expected ordering cost, and expected interest paid, respectively, from the last cycle and their expressions are derived in Appendix 2 [see equations (45), (49), (60), (68), (41), (44), (48), (61), (69), respectively].
Expected total profit from the system
Now, expected total profit from the complete time horizon, \(E_{k}\{{\mathrm{TP}}(T)\}\), in \(k{\mathrm{th}}( k=1,2)\) case is given by
Problem formulation
When the resultant effects of inflation and discounting (R) are crisp in nature, then our problem is to determine T from
Solution procedure
Genetic algoritm (GA)
The discovery of genetic algorithms (GA) by Holland (1975) is further described by Goldberg (1998). GA is a randomized global search technique that solves problems imitating processes observed from natural evolution. GA continually exploits new and better solutions without any pre-assumptions such as continuity and unimodality. GA has been successfully adopted in many complex optimization problems and shows its merits over traditional optimization methods, especially when the system under study has multiple local optimal solutions. A GA normally starts with a set of potential solutions (called initial population) of the decision making problem under consideration. Individual solutions are called chromosomes. Crossover and mutation operations happen among the potential solutions to get a new set of solutions and it continues until terminating conditions are encountered. Michalewicz (1992) proposed a GA named contractive mapping genetic algorithm (CMGA) and proved the asymptotic convergence of the algorithm by Banach’s fixed-point theorem. In CMGA, movement from old population to new takes place only when average fitness of new population is better than the old one. The algorithm is presented below. In the algorithm, \(p_{c}, \; p_{m}\) are probability of crossover and probability of mutation, respectively, T is the generation counter, and P(T) is the population of potential solutions for generation T. M is iteration counter in each generation to improve P(T) and \(M_{0}\) is the upper limit of M. Initializing (P(1)) function generates the initial population P(1) (initial guess of solution set). Objective function value due to each solution is taken as fitness of the solution. Evaluating (P(T)) function evaluates fitness of each member of P(T).
GA algorithm
-
1.
Set generation counter \(T=1\), iteration counter in each generation \(M=0\).
-
2.
Initialize probability of crossover \(p_{c}\), probability of mutation \(p_{m}\), upper limit of iteration counter \(M_{0}\), population size N.
-
3.
Initialize (P(T)).
-
4.
Evaluate (P(T)).
-
5.
While (\(M<\,M_{0}\)).
-
6.
Select N solutions from P(T) for mating pool using roulette-wheel selection process Michalewicz (1992). Let this set be \(P^{\prime }(T)\).
-
7.
Select solutions from \(P^{\prime }(T)\), for crossover depending on \(p_{c}\).
-
8.
Make crossover on selected solutions.
-
9.
Select solutions from \(P^{\prime }(T)\), for mutation depending on \(p_{m}\).
-
10.
Make mutation on selected solutions for mutation to get population \(P_{1}(T)\).
-
11.
Evaluate (\(P_{1}(T)\)).
-
12.
Set \(M=M+1\).
-
13.
If average fitness of \(P_{1}(T)>\) average fitness of P(T), then
-
14.
Set \(P(T+1)=P_{1}(T)\).
-
15.
Set \(T=T+1\).
-
16.
Set \(M=0\).
-
17.
End if
-
18.
End while
-
19.
Output: Best solution of P(T).
-
20.
End algorithm.
The above model is solved by using GA approach, discussed in article-2. Our GA consists of parameters, population size = 50, probability of crossover = 0.6, probability of mutation = 0.2, and maximum generation = 50. A real number presentation is used here. In this representation, each chromosome X is a string of n numbers of GA, which denote the decision variable. For each chromosome X, every gene, which represents the independent variables, is randomly generated between their boundaries until it is feasible. In this GA, arithmetic crossover and random mutation are applied to generate new offsprings.
Perticle swarm optimization (PSO)
PSO is a population-based stochastic optimization technique developed by Eberhart and Kennedy in 1995, inspired by social behavior of bird flocking or fish schooling. A swarm of m particles moving about in an n-dimensional real-valued search space, the \(i{\mathrm{th}}\) particle is a n-dimensional vector, denoted as \(X_i=(x_{i1}, x_{i2}, x_{i3},\ldots ,x_{in}), i= 1, 2, 3,\ldots ,n\). The \(i{\mathrm{th}}\) particle's velocity is also a n-dimensional vector, denoted as \(V_{i}=(v_{i1}, v_{i2}, v_{i3},\ldots ,v_{in}), i= 1, 2, 3,\ldots ,n\). Denote the best position of the \(i{\mathrm{th}}\) particle as \(P_{\mathrm{besti}}=(p_{i1}, p_{i2}, p_{i3},\ldots ,p_{in}), i= 1, 2, 3,\ldots ,n\), and the best position of the colony \(P_{\mathrm{gbest}}=(p_{g1}, p_{g2}, p_{g3},\ldots ,p_{gn}), i= 1, 2, 3,\ldots ,n\). Each particle of the population modified its position and velocity according to the following mathematical expression:
where t is the current generation number, w is the inertia weight factor, \(c_1\) and \(c_2\) are learning factors, determining the influence of \(P_{\mathrm{besti}}\) and \(P_{\mathrm{gbest}}\), rand and Rand are random numbers uniformly distributed in the range (0, 1), \(V_i^t\) and \(X_i^t\) are the current velocity and position of the particle, respectively, \(P_{\mathrm{besti}}\) is the best solution this particle has reached, and \(P_{\mathrm{gbest}}\) is the current global best solution of all the particles.
The first part of the first formula is the inertia velocity of particle, which reflects the memory behavior of particle; the second part (the distance between the current position and the best position of the \(i{\mathrm{th}}\) particle) is “cognition” part, which represents the private thinking of the particle itself; the third part (the distance between the current position of the \(i{\mathrm{th}}\) particle and the best position of the colony) is the “social” part, showing the particle’s behavior stem from the experience of other particles in the population. The particles find the optimal solution by cooperation and competition.
Numerical example and sensitivity analysis
Let us consider a numerical example with the following numerical data:
\(C_{3}=50,\,C_{3}^{\prime }=40,\,C_{1}=0.75,\,P=95,\,m_{0}=1.8,\,\lambda =0.01,\,r=0.1,\,i=0.05,\,R=0.05,\gamma =0.05,p_{0}=4,I_{e}=0.15,I_{c}=0.2,m_{1}=0.8,\delta =0.5\) in appropriate units.
According to the proposed computational procedures (GA and PSO), the results listed in Table 1 are obtained for different values of \(M=4.0,4.2,4.4,4.5,4.6,4.8\) of case 1 and 2.
From the above numerical illustration, it is observed that for fixed \(\alpha\), \(\beta\) , and \(\theta\) as M increases, total profit also increases in both cases. Results are as per expectation.
Sensitivity analysis
Sensitivity analyses are performed using GA to study the effect of changes in different values of \(\alpha\), \(\beta\), \(\theta\), \(\lambda\), \(\delta\), R, and \(\gamma\) which are executed through the Tables 2, 3, 4, 5, 6, 7. It is observed that if \(\theta\) and \(\lambda\) are fixed for different values of \(\alpha\) as \(\beta\) increases, total profit increases. If \(\alpha\) and \(\lambda\) are fixed for different values of \(\beta\) as \(\theta\) increases, total profit decreases. And for fixed values of \(\alpha\), \(\beta\) , and \(\theta\) as \(\lambda\) increases, total profit decreases. It is also observed that for different values of \(\alpha\) as \(\delta\) increases, total profit increases, and for fixed values of \(\alpha\), \(\beta\), and \(\theta\) as R and \(\gamma\) increase, total profit decreases. All these observations agree with the reality.
Comparison of results using GA and PSO
From Table 8, it is observed that in all cases, GA gives the better results than PSO. For comparison, we consider ten different generations in 50 runs of both the algorithms and perform a t-test to study the convergence. The result of t- test is shown in Table 9. In view of that the performance of GA is acceptable. Also it is clear that there is no significant difference in the mean with the two optimization algorithms. In addition, PSO can also provide a more stable and reliable solution, because it yields significantly smaller standard deviation.
Conclusion and future scope
In this paper, a realistic production-inventory model for deteriorating items has been considered under inflation and permissible delay in payments with stock-dependent demand, over a random planning horizon. Also learning effect on production and setup costs is incorporated in an economic production quantity model. The model is formulated as a nonlinear programing problem and solved numerically by both GA and PSO and the compaired. Sensitivity analyses are also performed for different parameters to study the effect of the decision variable. Here, for the first time, trade credit is allowed in an inventory model with random planning horizon which is obtained in the case fashionable goods.
Finally, for future research, one can incorporate more realistic assumptions in the proposed model considering shortages, variable deterioration rate, stochastic nature of demand, and production rate. The similar problems can be formulated with multi-items with budget and space constraints.
Managerial insights
From the Table 8, it is observed that profit increases with trade credit. Therefore, a retailer will try to avoid the maximum trade credit from the supplier. In Table 2, higher \(\alpha\) and \(\beta\) furnish more profits. Specially, as \(\beta\) increases, profit increases. Hence, a retailer will adopt more display of goods for more sales and profits. From Tables 5 and 7, the profit increases with \(\delta\) and \(\gamma\). Thus, manager should always employ experience workers to get the benefit of their experience.
References
Alamri AA, Balkhi ZT (2007) The effects of learning and forgetting on the optimal production lot size for deteriorating items with time varying demand and deterioration rates. Int J Prod Econ 107:125–138
Chang CT, Ouyang LY, Teng JT (2003) An EOQ model for deteriorating items under supplier credits linked to ordering quantity. Appl Math Model 27:983–996
Chiu HN, Chen HM (2005) An optimal algorithm for solving the dynamic lot-sizing model with learning and forgetting in setups and production. Int J Prod Econ 95:179–193
Chung KH, Kim YH (1989) Economic analysis of inventory systems: a rejoinder. Eng Econ 35:75–80
Chung KJ, Liao JJ (2004) Lot-sizing decisions under trade credit depending on the ordering quantity. Comput Oper Res 31:909–928
Das D, Roy A, Kar S (2010a) Improving production policy for a deteriorating item under permissible delay in payments with stock-dependent demand rate. Comput Math Appl 60:1973–1985
Das D, Roy A, Kar S (2010b) A production-inventory model for a deteriorating item incorporating learning effect using genetic algorithm. Adv Oper Res. doi:10.1155/2010/146042
Das D, Kar MB, Roy A, Kar S (2012) Two-warehouse production model for deteriorating inventory items with stock-dependent demand under inflation over a random planning horizon. Cent Eur J Oper Res 20(2):251–280
Datta TK, Pal AK (1992) A note on a replenishment policy for an inventory model with linear trend in demand and shortages. J Oper Res Soc 43:993–1001
Giri BC, Pal SP, Chaudhuri KS (1996) An inventory model for deteriorating items with stock-dependent demand rate. Eur J Oper Res 95:604–610
Goldberg DE (1998) Genetic algorithms in search, optimization and machine learning. Addison Wesley, New York
Goyal SK (1985) Economic order quantity under conditions of permissible delay in payments. J Oper Res Soc 36:335–338
Gurnani C (1985) Economic analysis of inventory systems a reply. Int J Prod Res 23:771–772
Holland HJ (1975) Adaptation in natural and artificial systems. University of Michigan, Michigan
Hou KL (2006) An inventory model for deteriorating items with stock-dependent consumption rate and shortages under inflation and time discounting. Eur J Oper Res 168:463–474
Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Oper Res 174:1184–1190
Maiti AK, Maity MK, Maiti M (2006) Two storage inventory model with fuzzy deterioration over a random planning horizon. Appl Math Comput 183:1084–1097
Mandal BN, Phaujdar S (1989a) A note on inventory model with stock-dependent consumption rate. OPSEARCH 26:43–46
Mandal BN, Phaujdar S (1989b) An inventory model for deteriorating items and stock dependent consumption rate. J Oper Res Soc 40:483–488
Michalewicz Z (1992) Genetic algorithms + data structure = evolution programs. Springer, Berlin
Min J, Zhou YW, Liu G-Q, Wang S-D (2012) An EPQ model for deteriorating items with inventory-level-dependent demand and permissible delay in payments. Int J Syst Sci 43(6):1039–1053
Moon I, Yun W (1993) An economic order quantity model with random planning horizon. Eng Econ 39:77–86
Ouyang LY, Chang CT (2013) Quality improvement, setup cost and lead-time reductions in lot size reorder point models with an imperfect production process. Int J Prod Econ 144(2):610–617
Roy A, Maiti MK, Kar S, Maiti M (2007) Two storage inventory model with fuzzy deterioration over a random planning horizon. Math Comput Model 46:1419–1433
Roy A, Pal S, Maiti MK (2009a) A production inventory model with stock dependent demand incorporating learning and inflationary effect in a random planning horizon: A fuzzy genetic algorithm with varying population size approach. Comput Ind Eng 57:1324–1335
Roy A, Maiti MK, Kar S, Maiti M (2009b) An inventory model for a deteriorating item with displayed stock dependent demand under fuzzy inflation and time discounting over a random planning horizon. Appl Math Model 33(2):744–759
Su SM, Lin SD, Chang LF (2014) The optimal inventory policy for reusable items with random planning horizon considering present value. Appl Math 5:292–299
Teng J-T, Krommyda IP, Skouri K, Lou K-R (2011) A comprehensive extension of optimal ordering policy for stock-dependent demand under progressive payment scheme. Eur J Oper Res 215:97–104
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1
[Calculation for expected sales revenue for N full cycles]: present value of holding cost of the inventory for the \(j{\mathrm{th}} (1\le j \le N)\) cycle, \(({\mathrm{HC}}_{j})\), is given by
Total holding cost from N full cycles, (HCN), is given by
So, the present value of expected holding cost from N complete cycles, (EHCN), is given by
Present value of production cost for the \(j{\mathrm{th}}(1\le j \le N)\) cycle, \(({\mathrm{PC}}_{j})\), is given by
Present value of total production cost from N full cycles, (PCN), is given by
Present value of expected total production cost from N full cycles, (EPCN), is given by
Present value of ordering cost for the \(j{\mathrm{th}} (1\le j \le N)\) cycle, \(C_{3}^j\), is given by
Present value of total ordering cost from N full cycles, (TOCN), is given by
Present value of expected total ordering cost from N full cycles, (ETOCN), is given by
Present value of selling price for the \(j{\mathrm{th}}(1\le j \le N)\) cycle, \(({\mathrm{SR}}_{j})\), is given by
Present value of total selling price from N full cycles, (SRN), is given by
Present value of expected total selling price from N full cycles, (ESRN), is given by
Calculation for interest earned and interest paid in \(j{\mathrm{th}}\) cycle
The retailer pays the payment at M without any interest, and at the end of this period, He/She starts paying for the interest charges on the items in stocks. Also during the time the account is not settled, generated sales revenue is deposited in an interest bearing account. Regarding the interest pay and interest earned based on the length of the \(j{\mathrm{th}}\) \((1\le j\le N)\) cycle time T, two different cases may arise:
Case-1 \((j-1)T+M\le (j-1)T+t_{1}\le jT\)
Present value of Interest earned in \(j{\mathrm{th}}\) cycle, \(I_{1}E_{j}\) is given by
Total interest earned during N full cycles, \(I_{1}EN\) is given by
Present expected value of total interest earned during N full cycles, \(EI_{1}EN ,\) is given by
Present value of interest paid to the wholeseller for the \(j{\mathrm{th}}\,(1\le j \le N)\) cycle, \((I_{1}P_{j}) ,\) is given by
Total interest paid during N full cycles, \(I_{1}PN ,\) is given by
Present expected value of total interest paid during N full cycles, \(EI_{1}PN ,\) is given by
Case-2 \((j-1)T+{t}_{1}<(j-1)T+M\le jT\)
Present value of Interest earned in \(j{\mathrm{th}}\) cycle, \(I_{2}E_{j} ,\) is given by
Total interest earned during N full cycles, \(I_{2}EN ,\) is given by
Present expected value of total interest earned during N full cycles, \(EI_{2}EN ,\) is given by
Present value of interest paid to the wholeseller for the \(j{\mathrm{th}}(1\le j \le N)\) cycle, \((I_{2}P_{j}) ,\) is given by
Present expected value of total interest paid during N full cycles, \(EI_{2}PN ,\) is given by
Present expected value of total interest paid during N full cycles, \(EI_{2}PN\), is given by
Appendix 2
[Calculation for expected sales revenue for last cycle] part-I ( \(NT<h \le NT+t_{1}\)): present value of holding cost of the inventory for the last cycle is given by
Present value of production cost is given by
Present value of ordering cost \(=\,\{C_{3}+ C^{\prime }_{3}.e^{-\delta (N+1)}\}e^{-NRT}.\)
Present value of sales revenue is given by
Part-II (\(NT+t_{1} < h \le (N+1)T\)): Present value of holding cost of the inventory for the last cycle is given by
Present value of production cost is given by
Present value of ordering cost= \(\{C_{3}\)+\(C^{\prime }_{3}.e^{-\delta (N+1)}\}\).\(e^{-RNT} .\)
Present value of sales revenue is given by
Present value of expected holding cost for the last cycle is given by
where
and
Present value of expected production cost for the last cycle is given by
Present value of expected sales revenue from the last cycle is given by
where
and
Present value of expected ordering cost for the last cycle is given by
Present value of expected reduced selling price from the last cycle is given by
where
and
Calculations for interest earned and interest paid in last cycle
Case 1 \((NT+M\le NT+{t}_{1}\le (N+1)T)\)
Subcase (1a) \((NT\le t\le NT+M)\)
Present value of interest earned in last cycle, \({\mathrm{IEL}}_{11} ,\) is given by
Present expected value of interest earned in the last cycle, \({\mathrm{EIEL}}_{11} ,\) is given by
Subcase (1b) \((NT+M\le t\le NT+{t}_{1})\)
Present value of interest earned in last cycle, \({\mathrm{IEL}}_{12} ,\) is given by
Present expected value of interest earned in the last cycle, \({\mathrm{EIEL}}_{12} ,\) is given by
Present value of interest paid in the last cycle, \({\mathrm{IPL}}_{12} ,\) is given by
Present expected value of interest paid in the last cycle, \({\mathrm{EIPL}}_{12} ,\) is given by
Subcase (1c) \(\left( NT+{t}_{1}\le t\le (N+1)T\right)\)
The expression of the present expected value of interest earned in the last cycle, \({\mathrm{EIEL}}_{13} ,\) is same as Eq. (55).
Present value of interest paid in the last cycle, \({\mathrm{IPL}}_{13} ,\) is given by
Present expected value of interest paid in the last cycle, \({\mathrm{EIPL}}_{13} ,\) is given by
Total expected interest earned for the last cycle,\(EI_{1}E_{L} ,\) is given by
Total expected interest paid for the last cycle,\(EI_{1}P_{L} ,\) is given by
Case 2 \((NT+{t}_{1}\le NT+M\le (N+1)T)\)
Subcase (2a) \((NT\le t\le NT+{t}_{1})\)
The expression of the present expected value of interest earned in the last cycle, \({\mathrm{EIEL}}_{21} ,\) is same as Eq. (53).
Subcase (2b) \((NT+{t}_{1}\le t\le NT+M)\)
Present value of interest earned in last cycle, \({\mathrm{IEL}}_{22} ,\) is given by
Present expected value of interest earned in the last cycle, \({\mathrm{EIEL}}_{22} ,\) is given by
Subcase (2c) \((NT+M\le t\le (N+1)T)\)
Present value of interest earned in last cycle, \({\mathrm{IEL}}_{23} ,\) is given by
Present expected value of interest earned in last cycle, \({\mathrm{EIEL}}_{23} ,\) is given by
Present value of interest paid in the last cycle, \({\mathrm{IPL}}_{23} ,\) is given by
Present expected value of interest paid in the last cycle, \({\mathrm{EIPL}}_{23} ,\) is given by
Total expected interest earned for the last cycle, \(EI_{2}E_{L} ,\), is given by
Total expected interest paid for the last cycle, \(EI_{2}P_{L} ,\) is given by
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Kar, M.B., Bera, S., Das, D. et al. A production-inventory model with permissible delay incorporating learning effect in random planning horizon using genetic algorithm. J Ind Eng Int 11, 555–574 (2015). https://doi.org/10.1007/s40092-015-0121-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40092-015-0121-y