Research Article

Multilevel Production Systems with Dependent Demand with Uncertainty of Lead Times

Table 1


Type of systemAuthor(s)Order policyCriteriaSolution methods

One-level Chu et al. (1993) [9]Lot-for-lotHolding and backlogging costIterative algorithm
Proth et al. (1997) [24]Lot-for-lotHolding and backlogging costHeuristic algorithm
Dolgui et al. (2002) [25]Lot-for-lotHolding and backlogging costMarkovian model
Ould-Louly and Dolgui (2004) [10]Lot-for-lotHolding and backlogging costsMarkovian and Newsboy model for a dynamical multiperiod planning
Louly et al. (2008) [26]Lot-for-lotMinimized holding cost with keeping a high customer service levelOptimization
Louly and Dolgui (2011) [27]POQholding, finished product backlogging, and setup costsBranch and Bound
Louly et al. (2012) [12]POQSetup and holding costsOptimization
Sadeghi et al. (2013) [13]POQMinimized fixed ordering, holding, and backlogging costsOptimization
Sadeghi et al. (2015) [19]POQMinimized fixed ordering, holding, and backlogging costsOptimization

Two-levelYano (1987) [8]Lot-for-lotSum of holding and tardiness costsNonlinear programming
Tang and Grubbström (2003) [28]Lot-for-lotStock-out and inventory holding costsLaplace transform procedure
Axsäter (2006) [29]Approximate decomposition technique, continuous distributions
Hnaien et al. (2009) [15]Lot-for-lotHolding and backlogging costGenetic algorithm optimization
Hnaien et al. (2010) [17]Lot-for-lotHolding costs to maximize the customer service levelGenetic algorithms
Sakiani et al. (2012) [16]POQMinimized holding cost and maximized customer serviceNSGA-II algorithm, multiobjective, tournament selection
Sadeghi et al. (2015) [18]POQMinimized sum of fixed ordering, holding, and backlogging costsOptimization

Multi-LevelAmmar et al. (2014) [22]Lot-for-lotHolding, backlogging, and inventory holding costSimulation, mathematical model, GA
Current paperPOQMinimized expected fixed ordering, holding, and partial backlogging cost with a percentage of components at each level are scrapOptimization