Research Article  Open Access
Duan Gang, Chen Li, Li YinZhen, Song JieYan, Akhtar Tanweer, "Optimization on ProductionInventory Problem with Multistage and Varying Demand", Journal of Applied Mathematics, vol. 2012, Article ID 648262, 17 pages, 2012. https://doi.org/10.1155/2012/648262
Optimization on ProductionInventory Problem with Multistage and Varying Demand
Abstract
This paper addresses productioninventory problem for the manufacturer by explicitly taking into account multistage and varying demand. A nonlinear hybrid integer constrained optimization is modeled to minimize the total cost including setup cost and holding cost in the planning horizon. A genetic algorithm is developed for the problem. A series of computational experiments with different sizes is used to demonstrate the efficiency and universality of the genetic algorithm in terms of the running time and solution quality. At last the combination of crossover probability and mutation probability is tested for all problems and a law is found for large size.
1. Introduction
Productioninventory control plays a vital role in the management of manufacturing enterprises. During production process we often hope that the volume of a given product is just enough to satisfy customers’ demand without overextending the production line and manufacturing too many. The redundant inventory will cut down our net profit. On the other hand, lacking supply will also make a heavy loss when a big order is placed. So there must be an optimal production quantity.
Many researchers are interested in this problem and it has been investigated from various perspectives. Goyal and Giri [1] develop two different models for the productioninventory problem, in which the demand, production, and deterioration rates of a product are assumed to vary with time over an infinite planning horizon. Shortages of a cycle are allowed to be backlogged partially. Huang [2] proposes an optimal integrated vendorbuyer inventory policy for flawed items in a justintime manufacturing environment. The production process is assumed to deteriorate during processing and produces a certain number of defective items. The objective is to minimize the total joint annual costs incurred by the vendor and the buyer. Hill [3] considers the problem of a vendor supplying a product to a buyer with the product manufactured in batches at a finite rate. And the structure of the globallyoptimal solution is derived. Gayon et al. [4] formulate the joint productioncontrol and inventoryallocation problem as a Markov decision process and characterize the structure of the optimal policy. They draw a conclusion that the optimal inventoryallocation policy is a statedependent multilevel rationing policy, with the rationing level for each class nondecreasing in the number of announced orders. An adaptive control approach with a feedback is applied to track the inventory levels toward their goal levels by Alshamrani [5, 6].
Considering uncertainty, Doğru et al. [7] develop a stochastic program to allow preferential component allocation for minimizing total inventory cost in assembletoorder inventory systems with identical component lead times. Zijm and Houtum [8] compare the optimal base stock policy under stochasticcircumstance with an MRP systemin terms of cost effectiveness given a predefined target customer service level. And they also take stochasticlead times into consideration in amultistage productiontoordersystem. According to setting safety lead times, it leads to similar decomposition structures as those derived formultistage inventory systems. Kleywegt et al. [9] formulate the inventory routing problem as a Markov decision process. Gupta and Wang [10] investigate credit terms in inventory problem with random demand. They prove that the structure of the optimal inventory policy is not affected by credit terms under a discrete time of the retailer’s operations, although the value of the optimal policy parameter is.
Ouyang et al. [11] address the same problem based on a deterministic model by fuzzifying the rate of interest charges, the rate of interest earned, and the deterioration rate into the triangular fuzzy number. Hsieh [12] proposes two fuzzy inventory models with fuzzy parameters for crisp order quantity, or for fuzzy order quantity under decision maker’s preference. He demonstrates that the optimal order quantity or the optimal fuzzy order quantity of the two models are the real numbers. The optimal solutions can be specified to meet classical production inventory models under a given condition. References [13–16] also focus on the fuzzy optimal inventory problem.
Chao et al. [17] research operational decisions in dynamic inventory management are correlated with and constrained by financial flows of the firm. A general framework for incorporating financial states of an organization in multiperiod inventory models with lost sales is proposed. Hopp and Xu [18] propose a static approximation of dynamic demand substitution behavior based on a fluid network model and a serviceinventory mapping. The interdependent inventory/service, price, and product assortment decisions in noncompetitive and competitive scenarios with demand substitution are analyzed. Olsen and Parker [19] investigate consumer behavior of potentially leaving the firm’s market when he encounters an inventory stockout at a retailer under the stochastic demand distribution in a timedynamic context. A single firm and a duopoly case are modeled, respectively.
Many researches of perishable inventory problem are investigated. Broekmeulen and Donselaar [20] take into account of the age of the inventory for perishable products at retailers. The new policy they conclude leads to substantial cost reductions compared with a base policy that does not take into account the age of inventories. Duan et al. [21] propose two kinds of inventory models, with and without backlogging, respectively, for perishable items. At last they draw a conclusion that the proposed model is generalization of present ones. Gumasta et al. [22] consider the transportation of perishable goods from distributer to retailer. They simultaneously maximize the revenue and minimize transportation and inventory cost so as to maximize the net profit. Other related researches under stochasticcircumstance can be referenced in [23, 24]. And Markov model for an inventory system with perishable items can be referenced in [25–27] and so on.
Some researchers are interested indiscussing backorder problem in inventory. Yao and Chiang [28] take the storing cost , backorder cost , cost of placing an order , total demand , order quantity , and shortage quantity as the triangular fuzzy numbers and use the signed distance method to defuzzify. Gürler et al. [29] consider bayesian updating of demand and backorder distributions in a partial backorder newsvendor model. In order to model the relationship between risks and risk propagation in supply chain, Shin et al. [30] apply bayesian belief network to develop alternative backorder replenishment plan to minimize the total replenishment cost and expected risk cost. Hu et al. [31] and Shahand Soni [32] assume production elapsed time and demand to be a fuzzy random variable with backorder, respectively. We can also refer to [33–38] about backorder aspect.
The method for assembly line balancing problem is very similar to the inventory problem. Sotskov et al. [39, 40] minimize the number of stations for processing partially ordered operations within the given cycle time. They derive necessary and sufficient conditions when optimality of the line balance is stable with respect to sufficiently small variations of the operationtimes. Özcan and Toklu [41–43] and Purnomo et al. [44] research twosided assembly lines balancing problem. Kellegöz and Toklu [45] address a branch and bound algorithm to solve the problem. Compared with the existing algorithm, the proposed algorithm outperforms it in terms of both CPU times and quality of feasible solutions found.
The traditional deterministic inventory models are based on the assumption that the demand rate is constant and order cycle is inflexible. As we all know the total cost is the integral of the productioninventory function because the production time is the same and the maximum inventory in every stage is also equal. But actually there is more than one customer. Demand cycles of these customers are different and the demand rate of every customer is also varying. This is multistage and varying demand productioninventory problem without stockout. In the planning horizon, which is the sum of all stages, what we face to decide is also when and how many quantity to produce in order to minimize the total cost subject to meeting every stage demand. Under the circumstance the traditional unconstrained optimization method is not suitable for the issue although it is still linear. Because according to every demand and its cycle there are different maximum inventory in every stage under different production schedules which means production frequency and production time. We have to define the maximum inventory in every stage for the sake of obtaining the objective function. And this definition relation is only determined by the constraint. So constrained optimization method will be applied to solve the problem. Motivated by the above case we model a hybrid integer programming to characterize the problem and solve it by using genetic algorithm.
The remainder of the paper is organized as follows. Section 2 is dedicated to the description of the modeling approach. Section 3 presents a genetic algorithm to solve the problem. Section 4 reports our computational results on test instance. Finally, conclusions are drawn in Section 5.
2. ProductionInventory Model
2.1. Problem Description
In multistage productioninventory system, every stage extent is versatile, demand rate is also different and production rate is a constant and is more than demand rate in every stage. The productioninventory status is drawn in Figure 1 according to the production rate and demand rate in every stage. The planning horizon is made up of five stages. denotes the extent of stage . There are twice production in Figure 1. The production mode is as shown in Figure 1(a). The first production begins from Stage 1 and ends in Stage 2 lasting time long. And at time the inventory reaches maximum. The maximum inventory in the first production is consumed in the end of Stage 3. We call it a production cycle from Stage 1 to Stage 3. Stage 3 is called the end of one production cycle. The second production cycle includes Stage 4 and Stage 5 lasting time long. Figure 1(b) depicts another case of twice production. The first production cycle is from Stage 1 to Stage 4 and the second production cycle is in Stage 5 alone.
(a) Twice production
(b) Another two times production
In fact there are four production schemes under the circumstance of twice production. Except the above two schemes mentioned, one is that the first production is in Stage 1 alone and the second production starts from Stage 2 to Stage 5. The other is that the first production begins from Stage 1 to Stage 3 and the second production starts from Stage 4 to Stage 5.
One extreme case is five times production in planning horizon, that is, production occurs in every stage and the quantity as inventory in every stage only satisfies the current stage demand. The other extreme case is only once production in planning horizon. The best production times and quantity are specified by the total cost which bears setup cost of production and carrying cost held in inventory. And we will find the best production scheme under all production times.
2.2. Model
2.2.1. Denotations Definition
First we define some denotations in our model to express the above conception. Parameters are defined as follows. : Production rate. : The extent of stages. : Production times, . : Demand extent of stage . : Demand rate in stage . : Setup cost of production once. : Holding cost per unit volume per unit time held in inventory. : Planning horizon. Obviously equals to the sum of , that is, . Variables are defined as follows: : The production time of one production cycle which begins from stage and ends in stage , : The inventory level at the beginning of stage : The maximum inventory level at time in stage , . The variable maximum inventory is positive if and only if belongs to the interval
2.2.2. Constraints
(1)Because the stockout is not permitted, the total quantity should be equal to the sum of demands in the planning horizon. And the quantity in every production in a certain stage interval should satisfy the demand in the same stage interval: (2)Production times in the planning horizon are calculated by the following formula: (3)Production time should be less than demand time: (4)The logic variables should satisfy the following: The binary function is defined as Formula (2.8) means if and only if , and every are met simultaneously. (5)The inventory level at the beginning of stage is derived by the following: where and It is the fact that a new production begins in stage when becomes zero. In other case is always more than zero. When the production time lasts time long in a production cycle, the first item in formula (2.10) indicates the inventory at the beginning of stage which is before stage . And the second item in formula (2.10) indicates the inventory at the beginning of stage which is after stage . For different and , the variable may be zero. Only when equals to one, is the right inventory at the beginning of stage . So we solve it by maximization.(6)The relationship between the logic variables and and continuous variable is characterized as follows: (7)The maximum inventory level is deduced according to the following: (8)when and production time is , the item in formula (2.13) means the new inventory level during stage . So is the sum of the inventory at the beginning of stage and . At last the variables are defined as: The initial conditions are and .
2.2.3. Objective
The sum cost holds setup cost of production and carrying cost held in inventory. So the objective is to minimize the sum cost.
When producing times in the planning horizon the total setup cost is where is setup cost producing once. In every production cycle we suppose that production time is and . Then we employ formula (2.4) to formula (2.13) to get the values of and .
and are the inventory levels at the beginning of stage and stage , respectively. Because the inventory figures from stage to stage are all trapezoids. The area of a trapezoid is calculated by . In fact the inventory figure of stage is a triangle for the inventory level is zero such as inventory figure of Stage 1 in Figure 1(b). We may take a triangle as a degenerate trapezoid in which one edge length is zero. So we use uniform area formula. From stage to stage when is more than , the holding cost is where is holding cost per unit volume per unit time held in inventory.
In stage where production stops the inventory figure is made up of two trapezoids such as the inventory figure of the Stage 3 in Figure 1(b). So the holding cost in stage is
The case from stage to stage is similar to stage to stage . Therefore, the holding cost from stage to stage is
So given production times , we could solve the minimal average total cost under every possible production mode in the planning horizon as
For every possible production times , we minimize the average total cost in the planning horizon. So the objective is
3. Solution Procedure
We solve the solution by employing Genetic Algorithm (GA). GA is a stochastic search method that works on a population of the solutions simultaneously and searches large and complicated fields based on the mechanics of natural genetics and evolutionary principles. In addition, it is particularly suitable for optimization problems with an objective function subject to numerous constraints. GA has demonstrated considerable success in these optimization problems and received more and more attentions during the past decades.
3.1. Chromosome Encoding and Decoding
We encode each chromosome as an string of integers whose components are the production cycles. Suppose that there are stages in the planning horizon. We generate integers randomly to satisfy . For example, let and . A chromosome is may be (2 5 1 2). It means there is total 4 times production. The first production cycle is from Stage 1 to Stage 2. The second is from Stage 3 to Stage 7. The third is in Stage 8 alone. And the last production cycle is from Stage 9 to Stage 10.
The decoding procedure is as follows. When a chromosome is determined, we could decode this chromosome to get first. Then according to formula (2.5) we could obtain . By formula (2.10) and formula (2.13) we would find , and finally.
3.2. Crossover
Crossover generates offspring by operating parent chromosomes. Let parameter be the crossover probability. A chromosome will be selected as a parent when , where is a random number generated from the interval . We apply single parent crossover operator. For a selected parent chromosome with integers, and are stochastically generated from the interval and different. We exchange the value of location and the value of location in the parent chromosome. Figure 2 shows an example. The stochastically generated number is 2 and 3. An offspring (2 1 5 2) is obtained after exchanging 5 and 1. The crossover operator aims to change production scheme under a fixed production times.
3.3. Mutation
Mutation modifies a chromosome to form an offspring. Let parameter be the mutation probability. A chromosome will be selected as a parent when , where is a random number generated from the interval . We randomly choose a location in a selected chromosome. Then generate an integer stochastically, , from the interval . Then we compare the value of location in the chromosome and . For the offspring (2 1 5 2), is 3 and is 6. Obviously 5 is less than 6. So we sum the values of right position and substitute the new sum, 7, for origin value, 5. The case of mutation is depicted in Figure 3(a). If is less than 5, let the sum of two numbers which are both more than 0 equals to 5. For example, , which is less than 5, we find two numbers and randomly satisfying . Then and replace 5. The case of mutation is drawn in Figure 3(b) where and . The mutation operator aims to change production times by increasing or decreasing it.
(a) Case 1: q is more than the value of position p
(b) Case 2: q is less than the value of position p
3.4. Evaluation Function and Selection
Evaluation function is to evaluate the quality of a chromosome. We define evaluation value of a chromosome as the objective function of the corresponding solution.
The selection strategy means how to choose the chromosomes in the current population will create offspring for the next generation. We take the roulette wheel as selection mechanism, in which each chromosome is assigned a slice of a circular roulette wheel and the size of the slice is proportional to the chromosome’s evaluation value.
4. Computational Results
In this section we perform a series of computational experiments to evaluate the GA proposed in Section 3 in different size problems. The experiments have been coded in C programming and implemented on an Athlon 3.10 GHz PC, with 3.12 GB of RAM, running on Windows XP.
In order to test the efficiency and universality of the GA, we generate four groups of data randomly in which stages are 10, 20, 50, and 100, named problems 1, 2, 3, and 4, respectively. Tables 1, 2, 3 and 4 show the exact values of demand extent and demand rate of every problem. The production rate is set as 320 in these problems. The setup cost of production once and holding cost per unit volume per unit time are $2 and $10000, respectively. The parameters in our GA are chosen as follows. The population size , crossover probability , and mutation probability .




We execute the GA in 30 independent runs on each problem. The evaluation value is recorded for every trial in every problem and shown in Figure 4. Table 5 displays the computational results including number of generations, the best found evaluation value, average evaluation value, standard deviation, and average running time for the 30 trials in the four problems. Because the scale of every problem is different, the smaller the problem is the fewer the number of generations is. The results reveal that the proposed GA could effectively solve the problem in different sizes.

Because the parameters in the proposed GA, crossover probability and mutation probability, play a crucial role of the result, we also test the best combination of the two parameters for all problems. Both crossover probability and mutation probability vary from 0.1 to 0.9 when the step is 0.1. So there are 81 combinations in every problem. The average evaluation value is obtained from 30 independent trials under all combinations. Figure 5 displays the comparison results. The best combination is shown as Table 6. It is obvious that the average evaluation value in Table 6 is much better than that in Table 5 for the same problem.

(a) For Problem 1
(b) For Problem 2
(c) For Problem 3
(d) For Problem 4
For Problem 1 the best combination parameters are (0.4, 0.5) and (0.9, 0.8). This indicates that Problem 1 is not sensitive to the two parameters. Owing to the small size of Problem 1, if the number of generations increases we could find better solution than the former under any combination parameters. For example, when the number of generations reaches 1000, the average evaluation value is 1419.8273 from the 30 trials under the worst combination (0.1, 0.2) whose average evaluation value is 1482.9856 and number of generations is 100 in Figure 5(a). At the same time the average running time is only one second.
We find a law in Figures 5(c) and 5(d) that when given a value of crossover probability, the average evaluation value almost increases with the increase of mutation probability. And we test other experiments generated randomly where stage is from 60 to 90 (in which step is 10) under all combination parameters. The results reflect the same law. However, it is not the same case in Figures 5(a) and 5(b). This demonstrates that when the problem size is large the mutation probability should be small. So we could only find the best crossover probability. The best combination in Problems 3 and 4 is the same in Table 6. But it is just by chance because in the latter experiments we do not find the same best combination.
Table 7 reports the partial best solutions and evaluation values found during search under the best combination parameters for the four problems. The stages in a bracket in Table 7 indicate that they are in one continuous production cycle. And the stage which does not appear in Table 7 for every problem means a production cycle. For example, the first production cycle is from Stage 1 to Stage 2 in Problem 2. The second and the third production cycle are in Stage 3 and Stage 4, respectively. And the last production cycle starts from Stage 17 to Stage 20. So there are total twelve production cycles in Problem 2.

The most cases are that one production cycle includes two stages in Table 7. When one production cycle includes two stages, the sum cost is obviously smaller if the demand rate in the first stage is more than that in the second stage. So we can conclude from Table 7 that all demands rate of two successional stages in one production cycle satisfy the above condition. There is similar regular pattern for demands rate of three and four successional stages in one production cycle except a case in Problem 2 from Stage 14 to Stage 16. For demand rate in Stage 1 is almost equivalent to that in Stage 2 in Problem 3, we consider that it does not violate the rule. The demand rate in Stage 14 in Problem 2 is much less than those in the next two stages, but the three stages are still included in one production cycle. The main reason is that the demand extent in Stage 14 is very short (only 3). Among the four problems, the maximum number of stages included in a continuous cycle are four, whereas the last three problems it occurs only once. And demand rate in the first stage is greater than the sum of those in the latter three stages in Problem 2 and 4.
By increasing the number of stages and demands rate, the total cost must increase. But the average cost may not always be so. Although the stage number in Problem 2 is twice of it in Problem 1 and the demand rate in Problem 2 is also more than that in Problem 1, the average cost of Problem 2 is less than that of Problem 1. This suggests that the best production mode (production times and volume of production) could reduce the average cost. So the total cost must cut down.
5. Conclusion
In this paper it is found that the efficient and effective productioninventory strategy could reduce unnecessary funding, inventory cost, and production cycle. Furthermore, the productioninventory problem with multistage and varying demands, in which every stage extent is different, is investigated. Moreover, we generate a hybrid integer model to optimize the productioninventory process and a GA to find a better solution. Computational results illustrate that the proposed GA yields a highquality solution relatively fast. According to the tests of combination parameters we find the law between the average evaluation value and mutation probability under the large size.
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant nos. 60870008 and 61164003) and the Lanzhou Jiaotong University Young Scientific Research Fund Project (2011020).
References
 S. K. Goyal and B. C. Giri, “The productioninventory problem of a product with time varying demand, production and deterioration rates,” European Journal of Operational Research, vol. 147, no. 3, pp. 549–557, 2003. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 C. K. Huang, “An optimal policy for a singlevendor singlebuyer integrated productioninventory problem with process unreliability consideration,” International Journal of Production Economics, vol. 91, no. 1, pp. 91–98, 2004. View at: Publisher Site  Google Scholar
 R. M. Hill, “The optimal production and shipment policy for the singlevendor singlebuyer integrated productioninventory problem,” International Journal of Production Research, vol. 37, no. 11, pp. 2463–2475, 1999. View at: Google Scholar
 J. P. Gayon, S. Benjaafar, and F. Véricourt, “Using imperfect advance demand information in productioninventory systems with multiple customer classes,” Manufacturing and Service Operations Management, vol. 11, no. 1, pp. 128–143, 2009. View at: Publisher Site  Google Scholar
 A. M. Alshamrani, “Adaptive control of a twoitem inventory model with unknown demand rate coefficients,” Journal of Applied Mathematics, vol. 2012, pp. 1–16, 2012. View at: Publisher Site  Google Scholar
 A. M. Alshamrani, “Adaptive control of a reverse logistic inventory model with uncertain deteriorations and disposal rates,” Advances in Operations Research, vol. 2012, pp. 1–11, 2012. View at: Publisher Site  Google Scholar
 M. K. Doğru, M. I. Reiman, and Q. Wang, “A stochastic programming based inventory policy for assembletoorder systems with application to the W model,” Operations Research, vol. 58, no. 4, pp. 849–864, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 H. Zijm and G. V. Houtum, “On multistage production/inventory systems under stochastic demand,” International Journal of Production Economics, vol. 35, no. 1–3, pp. 391–400, 1994. View at: Google Scholar
 A. J. Kleywegt, V. S. Nori, and M. W. P. Savelsbergh, “The stochastic inventory routing problem with direct deliveries,” Transportation Science, vol. 36, no. 1, pp. 94–118, 2002. View at: Publisher Site  Google Scholar
 D. Gupta and L. Wang, “A stochastic inventory model with trade credit,” Manufacturing and Service Operations Management, vol. 11, no. 1, pp. 4–18, 2009. View at: Publisher Site  Google Scholar
 L. Y. Ouyang, J. T. Teng, and M. C. Cheng, “A fuzzy inventory system with deteriorating items under supplier credits linked to ordering quantity,” Journal of Information Science and Engineering, vol. 26, no. 1, pp. 231–253, 2010. View at: Google Scholar
 C. H. Hsieh, “Optimization of fuzzy inventory models under $k$preference,” Tamsui Oxford Journal of Mathematical Sciences, vol. 19, no. 1, pp. 79–97, 2003. View at: Google Scholar
 C. H. Hsieh, “Optimization of fuzzy production inventory models,” Information Sciences, vol. 146, no. 1–4, pp. 29–40, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. H. Chen and S. M. Chang, “Optimization of fuzzy production inventory model with unrepairable defective products,” International Journal of Production Economics, vol. 113, no. 2, pp. 887–894, 2008. View at: Publisher Site  Google Scholar
 A. Roy, K. Maity, S. kar, and M. Maiti, “A productioninventory model with remanufacturing for defective and usable items in fuzzyenvironment,” Computers and Industrial Engineering, vol. 56, no. 1, pp. 87–96, 2009. View at: Publisher Site  Google Scholar
 J. K. Syed and L. A. Aziz, “Fuzzy inventory model without shortages using signed distance method,” Applied Mathematics & Information Sciences, vol. 1, no. 2, pp. 203–209, 2007. View at: Google Scholar  Zentralblatt MATH
 X. Chao, J. Chen, and S. Wang, “Dynamic inventory management with cash flow constraints,” Naval Research Logistics, vol. 55, no. 8, pp. 758–768, 2008. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 W. J. Hopp and X. Xu, “A static approximation for dynamic demand substitution with applications in a competitive market,” Operations Research, vol. 56, no. 3, pp. 630–645, 2008. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 T. L. Olsen and R. P. Parker, “Inventory management under market size dynamics,” Management Science, vol. 54, no. 10, pp. 1805–1821, 2008. View at: Publisher Site  Google Scholar
 R. Broekmeulen and K. Donselaar, “A heuristic to manage perishable inventory with batch ordering, positive leadtimes, and timevarying demand,” Computers and Operations Research, vol. 36, no. 11, pp. 3013–3018, 2009. View at: Publisher Site  Google Scholar
 Y. R. Duan, G. P. Li, J. M. Tien, and J. Z. Huo, “Inventory models for perishable items with inventory level dependent demand rate,” Applied Mathematical Modelling, vol. 36, no. 10, pp. 5015–5028, 2012. View at: Google Scholar
 K. Gumasta, F. T. S. Chan, and M. K. Tiwari, “An incorporated inventory transport system with two types of customers for multiple perishable goods,” International Journal of Production Economics, vol. 139, no. 2, pp. 678–686, 2012. View at: Google Scholar
 R. Jayaraman, B. Sivakumar, and G. Arivarignan, “A perishable inventory system with postponed demands and multiple server vacations,” Modelling and Simulation in Engineering, vol. 2012, Article ID 620960, 17 pages, 2012. View at: Publisher Site  Google Scholar
 H. Dong and G. Jiang, “Limit distribution of inventory level of perishable inventory model,” Mathematical Problems in Engineering, Article ID 329531, 9 pages, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 P. Manuel, B. Sivakumar, and G. Arivarignan, “A perishable inventory system with service facilities and retrial customers,” Computers and Industrial Engineering, vol. 54, no. 3, pp. 484–501, 2008. View at: Publisher Site  Google Scholar
 Z. Lian, X. Liu, and N. Zhao, “A perishable inventory model with Markovian renewal demands,” International Journal of Production Economics, vol. 121, no. 1, pp. 176–182, 2009. View at: Publisher Site  Google Scholar
 L. Aggoun, L. Benkherouf, and L. Tadj, “A hidden Markov model for an inventory system with perishable items,” Journal of Applied Mathematics and Stochastic Analysis, vol. 10, no. 4, pp. 423–430, 1997. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 J. S. Yao and H. M. Lee, “Fuzzy inventory with backorder defuzzification by signed distance method,” Journal of Information Science and Engineering, vol. 21, no. 4, pp. 673–694, 2005. View at: Google Scholar
 Ü. Gürler, E. Berk, and U. Akbay, “Bayesian updating of demand and backorder distributions in a newsvendor inventory problem,” in Proceedings of the 34th Conference on Applications of Mathematics in Engineering and Economics (AMEE '08), pp. 483–490, Sozopol, Bulgaria, 2008. View at: Google Scholar
 K. S. Shin, Y. W. Shin, J. H. Kwon, and S. H. Kang, “Development of risk based dynamic backorder replenishment planning framework using Bayesian Belief Network,” Computers & Industrial Engineering, vol. 62, no. 3, pp. 716–725, 2012. View at: Google Scholar
 J. S. Hu, H. Zheng, C. Y. Guo, and Y. P. Ji, “Optimal production run length with imperfect production processes and backorder in fuzzy random environment,” Computers and Industrial Engineering, vol. 59, no. 1, pp. 9–15, 2010. View at: Publisher Site  Google Scholar
 N. H. Shah and H. Soni, “A multiobjective production inventory model with backorder for fuzzy random demand under flexibility and reliability,” Journal of Mathematical Modelling and Algorithms, vol. 10, no. 4, pp. 341–356, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 G. Liberopoulos, I. Tsikis, and S. Delikouras, “Backorder penalty cost coefficient "b": what could it be?” International Journal of Production Economics, vol. 123, no. 1, pp. 166–178, 2010. View at: Publisher Site  Google Scholar
 K. C. Hung, “An inventory model with generalized type demand, deterioration and backorder rates,” European Journal of Operational Research, vol. 208, no. 3, pp. 239–242, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 G. A. Widyadana, L. E. CárdenasBarrón, and H. M. Wee, “Economic order quantity model for deteriorating items with planned backorder level,” Mathematical and Computer Modelling, vol. 54, no. 56, pp. 1569–1575, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 K.J. Chung and L. E. CárdenasBarrón, “The complete solution procedure for the EOQ and EPQ inventory models with linear and fixed backorder costs,” Mathematical and Computer Modelling, vol. 55, no. 1112, pp. 2151–2156, 2012. View at: Publisher Site  Google Scholar
 Y. J. Lin, “A stochastic periodic review integrated inventory model involving defective items, backorder price discount, and variable lead time,” 4OR. A Quarterly Journal of Operations Research, vol. 8, no. 3, pp. 281–297, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 H. Lin, “Effective investment to reduce setup cost in a mixture inventory model involving controllable backorder rate and variable lead time with a service level constraint,” Mathematical Problems in Engineering, vol. 2012, Article ID 689061, 15 pages, 2012. View at: Publisher Site  Google Scholar
 Y. N. Sotskov and A. B. Dolgui, “Stability radius of the optimal assembly line balance with fixed cycle time,” in Proceedings of the 8th International Conference on Emerging Technologies and Factory Automation (ETFA '01), pp. 623–628, October 2001. View at: Google Scholar
 Y. N. Sotskov, A. Dolgui, and M.C. Portmann, “Stability analysis of an optimal balance for an assembly line with fixed cycle time,” European Journal of Operational Research, vol. 168, no. 3, pp. 783–797, 2006. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 U. Özcan and B. Toklu, “Balancing of mixedmodel twosided assembly lines,” Computers & Industrial Engineering, vol. 57, no. 1, pp. 217–227, 2009. View at: Publisher Site  Google Scholar
 U. Özcan and B. Toklu, “Multiplecriteria decisionmaking in twosided assembly line balancing: a goal programming and a fuzzy goal programming models,” Computers & Operations Research, vol. 36, no. 6, pp. 1955–1965, 2009. View at: Publisher Site  Google Scholar
 U. Özcan, “Balancing stochastic twosided assembly lines: achanceconstrained, piecewiselinear, mixed integer program and a simulated annealing algorithm,” European Journal of Operational Research, vol. 205, no. 1, pp. 81–97, 2010. View at: Publisher Site  Google Scholar
 H. D. Purnomo, H. M. Wee, and H. Rau, “Twosided assembly lines balancing with assignment restrictions,” Mathematical and Computer Modelling, vol. 57, no. 12, pp. 189–199, 2013. View at: Publisher Site  Google Scholar
 T. Kellegöz and B. Toklu, “An efficient branch and bound algorithm for assembly line balancing problems with parallel multimanned workstations,” Computers & Operations Research, vol. 39, no. 12, pp. 3344–3360, 2012. View at: Google Scholar
Copyright
Copyright © 2012 Duan Gang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.