Cost implications of planned lead times in supply chain operations planning

In this paper we consider Supply Chain Operations Planning (SCOP) in a rolling horizon context under demand uncertainty. Production plans are calculated using a linear programming model. While in most mathematical programming models for SCOP the lead time is considered to be equal to zero or equal to the minimum processing time, we consider planned lead times. In this paper we concentrate on the optimal setting of the planned lead time. From queueing theory we know that the waiting time depends on the variance of the inter arrival times and on the utilization rate of the server. Since lead time consists for a part of waiting time, we consider the setting of planned lead times for various combinations of demand variance and utilization rates. A third factor we consider in the experiments is the difference in holding costs between the items produced by the capacitated resource and the end items. The results show that models with planned lead times are preferable above previous models without planned lead times

Rolling schedule approaches for supply chain operations planning

Supply Chain Operations Planning (SCOP) involves the determination of an extensive production plan for a network of manufacturing and distribution entities within and across organizations. The production plan consist of order release decisions that allocate materials and resources in order to transform these materials into (intermediate) products. We use the word item for both materials, intermediate products, and end-products. Furthermore, we consider arbitrary supply chains, i.e. the products produced by the supply chain as a whole and sold to customers consist of multiple items, where each item may in turn consists of multiple items and where each item may be used in multiple items as well. The aim of SCOP is not only to obtain a feasible production plan, but the plan must be determined such that pre-specified customer service levels are met while minimizing cost. To obtain optimal production plans we use a linear programming (LP) model. The reason we use an LP model is twofold. First, LP models can easily be incorporated in existing Advanced Planning Systems (APS). Second, while the multi-echelon inventory concept can only be used for uncapacitated supply chains and some special cases of capacitated supply chains, capacity constraints but also other restrictions can easily added to LP models. In former mathematical programming (MP) models, the needed capacity was allocated at a fixed time offset. This time offset was indicated by fixed or minimum lead times. By the introduction of planned lead times with multi-period capacity allocation, an additional degree of freedom is created, namely the timing of capacity allocation during the planned lead time. When using the LP model in a rolling schedule context, timing the capacity allocation properly can reduce the inventory cost. Although the number of studies on MP models for solving the SCOP or related problems are carried out by various researchers is enormous, only a few of these studies use a rolling schedule. Production plans are only calculated for a fixed time horizon based on the forecast of customers demand. However, since customer demand is uncertain, we emphasize the use of a rolling schedule. This implies that a production plan, based on sales forecasts, is calculated for a time interval (0; T], but only executed for the first period. At time 1, the actual demand of the first period is known, and the inventory status of the consumer products are adjusted according the actual demand. For time interval (1; T + 1], a new production plan is calculated. In this thesis, we studied the proposed LP strategy with planned lead times in a rolling schedule setting whereby we focused on the following topics: ² timing of production within the planned lead time, ² factors influencing the optimal planned lead time, ² early availability of produced items, i.e. availability of items before the end of their planned lead time, and ² balanced material allocation. In the first three studies we explore the possibilities of using planned lead times. In the first study, timing of production, we compare the situation whereby released items are produced as soon as there is available capacity with the situation whereby released items are produced as late as possible within the planned lead time. If items are produced as soon as possible, there is more capacity left for future production. Since we work with uncertain customer demand whereby demand may be larger than expected, this capacity might be very useful. A drawback of production as soon as possible are the additional work-in-process cost. The results of simulation studies show that if the utilization rates of resources and/or the variation in demand are high, producing early is better. However this is only the case if the added value between the concerned item and the end item is high. The second study deals with factors influencing the optimal planned lead time. From queuing theory it is already known that the variance in demand and the utilization rate of the resources determine the waiting time. More variation and/or higher utilization rates give longer waiting times. Since lead times consist for a large part of waiting time, these two factors most probably also influence the length of the optimal planned lead time. For a set of representative supply chain structures we showed that this was indeed the case. With longer planned lead times, the flexibility in capacity allocation is higher. Additional flexibility gives lower safety stocks, but longer planned lead times also means more work-in-process. Hence, an important third factor which influence the optimal planned lead time is the holding costs structure. When using planned lead times, early produced items have to wait the remainder of their planned lead time. This seems contradictory, especially if these items are necessary to avoid or reduce backorders. Therefore we adapt the standard LP model in two ways. In the first model, items are made available for succeeding production steps directly after they are produced. And in the second model, produced items are only made available for succeeding production steps if they are needed to avoid or reduce backorders. Experiments showed that the first model does not improve the performance of the standard LP strategy. The advantages of planned lead times longer than one period are nullified by early availability of produced items. The second model indeed improves the performance of the standard LP strategy, but only when the planned lead times are optimal or longer. Comparing the introduced LP strategy with a so-called synchronized base stock policy under the assumption of infinite capacity, it turned out that the LP strategy is outperformed by the base stock policy. In order to obtain a better performance, we Summary 121 added linear allocation rules to the LP model. With these allocation rules shortages of child items are divided among the parent items using a predefined allocation fraction. A second way of balanced allocation of child items is obtained by replacing the linear objective function by a quadratic one. The results of a well-chosen set of experiments showed that although the synchronized base stock policy also outperforms the adjusted LP strategies, the difference in performance is small. Hence, the adjusted LP strategies are good alternatives for large, capacitated supply chain structures which cannot be solved by synchronized base stock policies. Comparing the model with linear allocation rules with the model with quadratic objective function, the preference is given to the latter model. This model does not only give the lowest inventory costs, it also has the shortest computation time. Furthermore, this model can easily be implemented and solved by existing software. Summarizing the main results of this thesis, we conclude that deterministic LP models can be used to solve the SCOP problem with stochastic demand by using the LP model in a rolling schedule concept. By using optimal planned lead times with multiperiod capacity allocation, early production during the planned lead times, and early availability of needed produced items before the end of the planned lead time, we can decrease the inventory costs. The costs can also be reduced by using allocation strategies to allocate shortages among parent items proportionally. Especially the results for the model with quadratic objective function are promising

Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach

Integrated steel manufacturers (ISMs) have no specific product, they just produce finished product from the ore. This enhances the uncertainty prevailing in the ISM regarding the nature of the finished product and significant demand by customers. At present low cost mini-mills are giving firm competition to ISMs in terms of cost, and this has compelled the ISM industry to target customers who want exotic products and faster reliable deliveries. To meet this objective, ISMs are exploring the option of satisfying part of their demand by converting strategically placed products, this helps in increasing the variability of product produced by the ISM in a short lead time. In this paper the authors have proposed a new hybrid evolutionary algorithm named endosymbiotic-psychoclonal (ESPC) to decide what and how much to stock as a semi-product in inventory. In the proposed theory, the ability of previously proposed psychoclonal algorithms to exploit the search space has been increased by making antibodies and antigen more co-operative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results compared with other evolutionary algorithms such as genetic algorithms (GA) and simulated annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained and convergence time required to reach the optimal/near optimal value of the solution

Production planning and control of closed-loop supply chains

More and more supply chains emerge that include a return flow of materials. Many original equipment manufacturers are nowadays engaged in the remanufacturing business. In many process industries, production defectives and by-products are reworked. These closed-loop supply chains deserve special attention. Production planning and control in such hybrid systems is a real challenge, especially due to increased uncertainties. Even companies that are engaged in remanufacturing operations only, face more complicated planning situations than traditional manufacturing companies.We point out the main complicating characteristics in closed-loop systems with both remanufacturing and rework, and indicated the need for new or modified/extended production planning and control approaches. An overview of the existing scientific contributions is given. It appears that we only stand at the beginning of this line of research, and that many more contributions are needed and expected in the future.closed-loop supply chains;Production planning and control

An ESPC algorithm based approach to solve inventory deployment problem

Global competitiveness has enforced the hefty industries to become more customized. To compete in the market they are targeting the customers who want exotic products, and faster and reliable deliveries. Industries are exploring the option of satisfying a portion of their demand by converting strategically placed products, this helps in increasing the variability of product produced by them in short lead time. In this paper, authors have proposed a new hybrid evolutionary algorithm named Endosymbiotic-Psychoclonal (ESPC) algorithm to determine the amount and type of product to stock as a semi product in inventory. In the proposed work the ability of previously proposed Psychoclonal algorithm to exploit the search space has been increased by making antibodies and antigen more cooperative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results obtained, are compared with other evolutionary algorithms such as Genetic Algorithm (GA) and Simulated Annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained, and convergence time required to reach the optimal /near optimal value of the solution

An optimal-control based integrated model of supply chain

Problems of supply chain scheduling are challenged by high complexity, combination of continuous and discrete processes, integrated production and transportation operations as well as dynamics and resulting requirements for adaptability and stability analysis. A possibility to address the above-named issues opens modern control theory and optimal program control in particular. Based on a combination of fundamental results of modern optimal program control theory and operations research, an original approach to supply chain scheduling is developed in order to answer the challenges of complexity, dynamics, uncertainty, and adaptivity. Supply chain schedule generation is represented as an optimal program control problem in combination with mathematical programming and interpreted as a dynamic process of operations control within an adaptive framework. The calculation procedure is based on applying Pontryagin’s maximum principle and the resulting essential reduction of problem dimensionality that is under solution at each instant of time. With the developed model, important categories of supply chain analysis such as stability and adaptability can be taken into consideration. Besides, the dimensionality of operations research-based problems can be relieved with the help of distributing model elements between an operations research (static aspects) and a control (dynamic aspects) model. In addition, operations control and flow control models are integrated and applicable for both discrete and continuous processes.supply chain, model of supply chain scheduling, optimal program control theory, Pontryagin’s maximum principle, operations research model,

Global supply chains of high value low volume products

Imperial Users onl

Stochastic multi-period multi-product multi-objective Aggregate Production Planning model in multi-echelon supply chain

In this paper a multi-period multi-product multi-objective aggregate production planning (APP) model is proposed for an uncertain multi-echelon supply chain considering financial risk, customer satisfaction, and human resource training. Three conflictive objective functions and several sets of real constraints are considered concurrently in the proposed APP model. Some parameters of the proposed model are assumed to be uncertain and handled through a two-stage stochastic programming (TSSP) approach. The proposed TSSP is solved using three multi-objective solution procedures, i.e., the goal attainment technique, the modified ε-constraint method, and STEM method. The whole procedure is applied in an automotive resin and oil supply chain as a real case study wherein the efficacy and applicability of the proposed approaches are illustrated in comparison with existing experimental production planning method

Fuzzy goal programming for material requirements planning under uncertainty and integrity conditions

"This is an Accepted Manuscript of an article published in International Journal of Production Research on December 2014, available online: http://www.tandfonline.com/10.1080/00207543.2014.920115."In this paper, we formulate the material requirements planning) problem of a first-tier supplier in an automobile supply chain through a fuzzy multi-objective decision model, which considers three conflictive objectives to optimise: minimisation of normal, overtime and subcontracted production costs of finished goods plus the inventory costs of finished goods, raw materials and components; minimisation of idle time; minimisation of backorder quantities. Lack of knowledge or epistemic uncertainty is considered in the demand, available and required capacity data. Integrity conditions for the main decision variables of the problem are also considered. For the solution methodology, we use a fuzzy goal programming approach where the importance of the relations among the goals is considered fuzzy instead of using a crisp definition of goal weights. For illustration purposes, an example based on modifications of real-world industrial problems is used.This work has been funded by the Universitat Politecnica de Valencia Project: 'Material Requirements Planning Fourth Generation (MRPIV)' (Ref. PAID-05-12).Díaz-Madroñero Boluda, FM.; Mula, J.; Jiménez, M. (2014). Fuzzy goal programming for material requirements planning under uncertainty and integrity conditions. International Journal of Production Research. 52(23):6971-6988. doi:10.1080/00207543.2014.920115S697169885223Aköz, O., & Petrovic, D. (2007). A fuzzy goal programming method with imprecise goal hierarchy. European Journal of Operational Research, 181(3), 1427-1433. doi:10.1016/j.ejor.2005.11.049Alfieri, A., & Matta, A. (2010). Mathematical programming representation of pull controlled single-product serial manufacturing systems. Journal of Intelligent Manufacturing, 23(1), 23-35. doi:10.1007/s10845-009-0371-xAloulou, M. A., Dolgui, A., & Kovalyov, M. Y. (2013). A bibliography of non-deterministic lot-sizing models. International Journal of Production Research, 52(8), 2293-2310. doi:10.1080/00207543.2013.855336Barba-Gutiérrez, Y., & Adenso-Díaz, B. (2009). Reverse MRP under uncertain and imprecise demand. The International Journal of Advanced Manufacturing Technology, 40(3-4), 413-424. doi:10.1007/s00170-007-1351-yBookbinder, J. H., McAuley, P. T., & Schulte, J. (1989). Inventory and Transportation Planning in the Distribution of Fine Papers. Journal of the Operational Research Society, 40(2), 155-166. doi:10.1057/jors.1989.20Chiang, W. K., & Feng, Y. (2007). The value of information sharing in the presence of supply uncertainty and demand volatility. International Journal of Production Research, 45(6), 1429-1447. doi:10.1080/00207540600634949Díaz-Madroñero, M., Mula, J., & Jiménez, M. (2013). A Modified Approach Based on Ranking Fuzzy Numbers for Fuzzy Integer Programming with Equality Constraints. Annals of Industrial Engineering 2012, 225-233. doi:10.1007/978-1-4471-5349-8_27DOLGUI, A., BEN AMMAR, O., HNAIEN, F., & LOULY, M. A. O. (2013). A State of the Art on Supply Planning and Inventory Control under Lead Time Uncertainty. Studies in Informatics and Control, 22(3). doi:10.24846/v22i3y201302Dubois, D. (2011). The role of fuzzy sets in decision sciences: Old techniques and new directions. Fuzzy Sets and Systems, 184(1), 3-28. doi:10.1016/j.fss.2011.06.003Grabot, B., Geneste, L., Reynoso-Castillo, G., & V�rot, S. (2005). Integration of uncertain and imprecise orders in the MRP method. Journal of Intelligent Manufacturing, 16(2), 215-234. doi:10.1007/s10845-004-5890-xGuillaume, R., Thierry, C., & Grabot, B. (2010). Modelling of ill-known requirements and integration in production planning. Production Planning & Control, 22(4), 336-352. doi:10.1080/09537281003800900Heilpern, S. (1992). The expected value of a fuzzy number. Fuzzy Sets and Systems, 47(1), 81-86. doi:10.1016/0165-0114(92)90062-9Hnaien, F., Dolgui, A., & Ould Louly, M.-A. (2008). Planned lead time optimization in material requirement planning environment for multilevel production systems. Journal of Systems Science and Systems Engineering, 17(2), 132-155. doi:10.1007/s11518-008-5072-zHung, Y.-F., & Chang, C.-B. (1999). Determining safety stocks for production planning in uncertain manufacturing. International Journal of Production Economics, 58(2), 199-208. doi:10.1016/s0925-5273(98)00124-8Inderfurth, K. (2009). How to protect against demand and yield risks in MRP systems. International Journal of Production Economics, 121(2), 474-481. doi:10.1016/j.ijpe.2007.02.005JIMÉNEZ, M. (1996). RANKING FUZZY NUMBERS THROUGH THE COMPARISON OF ITS EXPECTED INTERVALS. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 04(04), 379-388. doi:10.1142/s0218488596000226Jiménez, M., Arenas, M., Bilbao, A., & Rodrı´guez, M. V. (2007). Linear programming with fuzzy parameters: An interactive method resolution. European Journal of Operational Research, 177(3), 1599-1609. doi:10.1016/j.ejor.2005.10.002Jones, D. (2011). A practical weight sensitivity algorithm for goal and multiple objective programming. European Journal of Operational Research, 213(1), 238-245. doi:10.1016/j.ejor.2011.03.012Lage Junior, M., & Godinho Filho, M. (2010). Variations of the kanban system: Literature review and classification. International Journal of Production Economics, 125(1), 13-21. doi:10.1016/j.ijpe.2010.01.009Jung, J. Y., Blau, G., Pekny, J. F., Reklaitis, G. V., & Eversdyk, D. (2004). A simulation based optimization approach to supply chain management under demand uncertainty. Computers & Chemical Engineering, 28(10), 2087-2106. doi:10.1016/j.compchemeng.2004.06.006Koh, S. C. L. (2004). MRP-controlled batch-manufacturing environment under uncertainty. Journal of the Operational Research Society, 55(3), 219-232. doi:10.1057/palgrave.jors.2601710Lai, Y.-J., & Hwang, C.-L. (1993). Possibilistic linear programming for managing interest rate risk. Fuzzy Sets and Systems, 54(2), 135-146. doi:10.1016/0165-0114(93)90271-iLee, H. L., & Billington, C. (1993). Material Management in Decentralized Supply Chains. Operations Research, 41(5), 835-847. doi:10.1287/opre.41.5.835Lee, Y. H., Kim, S. H., & Moon, C. (2002). Production-distribution planning in supply chain using a hybrid approach. Production Planning & Control, 13(1), 35-46. doi:10.1080/09537280110061566Li, X., Zhang, B., & Li, H. (2006). Computing efficient solutions to fuzzy multiple objective linear programming problems. Fuzzy Sets and Systems, 157(10), 1328-1332. doi:10.1016/j.fss.2005.12.003Louly, M.-A., & Dolgui, A. (2011). Optimal time phasing and periodicity for MRP with POQ policy. International Journal of Production Economics, 131(1), 76-86. doi:10.1016/j.ijpe.2010.04.042Louly, M. A., Dolgui, A., & Hnaien, F. (2008). Optimal supply planning in MRP environments for assembly systems with random component procurement times. International Journal of Production Research, 46(19), 5441-5467. doi:10.1080/00207540802273827Mohapatra, P., Benyoucef, L., & Tiwari, M. K. (2013). Integration of process planning and scheduling through adaptive setup planning: a multi-objective approach. International Journal of Production Research, 51(23-24), 7190-7208. doi:10.1080/00207543.2013.853890Mula, J., & Díaz-Madroñero, M. (2012). Solution Approaches for Material Requirement Planning* with Fuzzy Costs. Industrial Engineering: Innovative Networks, 349-357. doi:10.1007/978-1-4471-2321-7_39Mula, J., Poler, R., & García, J. P. (2006). Evaluación de Sistemas para la Planificación y Control de la Producción/[title] [title language=en]Evaluation of Production Planning and Control Systems. Información tecnológica, 17(1). doi:10.4067/s0718-07642006000100004Mula, J., Poler, R., & Garcia, J. P. (2006). MRP with flexible constraints: A fuzzy mathematical programming approach. Fuzzy Sets and Systems, 157(1), 74-97. doi:10.1016/j.fss.2005.05.045Mula, J., Poler, R., & Garcia-Sabater, J. P. (2008). Capacity and material requirement planning modelling by comparing deterministic and fuzzy models. International Journal of Production Research, 46(20), 5589-5606. doi:10.1080/00207540701413912Mula, J., Poler, R., & Garcia-Sabater, J. P. (2007). Material Requirement Planning with fuzzy constraints and fuzzy coefficients. Fuzzy Sets and Systems, 158(7), 783-793. doi:10.1016/j.fss.2006.11.003Mula, J., Poler, R., García-Sabater, J. P., & Lario, F. C. (2006). Models for production planning under uncertainty: A review. International Journal of Production Economics, 103(1), 271-285. doi:10.1016/j.ijpe.2005.09.001Noori, S., Feylizadeh, M. R., Bagherpour, M., Zorriassatine, F., & Parkin, R. M. (2008). Optimization of material requirement planning by fuzzy multi-objective linear programming. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 222(7), 887-900. doi:10.1243/09544054jem1014Olhager, J. (2013). Evolution of operations planning and control: from production to supply chains. International Journal of Production Research, 51(23-24), 6836-6843. doi:10.1080/00207543.2012.761363Peidro, D., Mula, J., Alemany, M. M. E., & Lario, F.-C. (2012). Fuzzy multi-objective optimisation for master planning in a ceramic supply chain. International Journal of Production Research, 50(11), 3011-3020. doi:10.1080/00207543.2011.588267Peidro, D., Mula, J., Jiménez, M., & del Mar Botella, M. (2010). A fuzzy linear programming based approach for tactical supply chain planning in an uncertainty environment. European Journal of Operational Research, 205(1), 65-80. doi:10.1016/j.ejor.2009.11.031Peidro, D., Mula, J., Poler, R., & Lario, F.-C. (2008). Quantitative models for supply chain planning under uncertainty: a review. The International Journal of Advanced Manufacturing Technology, 43(3-4), 400-420. doi:10.1007/s00170-008-1715-yPeidro, D., Mula, J., Poler, R., & Verdegay, J.-L. (2009). Fuzzy optimization for supply chain planning under supply, demand and process uncertainties. Fuzzy Sets and Systems, 160(18), 2640-2657. doi:10.1016/j.fss.2009.02.021Sabri, E. H., & Beamon, B. M. (2000). A multi-objective approach to simultaneous strategic and operational planning in supply chain design. Omega, 28(5), 581-598. doi:10.1016/s0305-0483(99)00080-8Selim, H., & Ozkarahan, I. (2006). A supply chain distribution network design model: An interactive fuzzy goal programming-based solution approach. The International Journal of Advanced Manufacturing Technology, 36(3-4), 401-418. doi:10.1007/s00170-006-0842-6Suwanruji, P., & Enns, S. T. (2006). Evaluating the effects of capacity constraints and demand patterns on supply chain replenishment strategies. International Journal of Production Research, 44(21), 4607-4629. doi:10.1080/00207540500494527Torabi, S. A., & Hassini, E. (2008). An interactive possibilistic programming approach for multiple objective supply chain master planning. Fuzzy Sets and Systems, 159(2), 193-214. doi:10.1016/j.fss.2007.08.010Torabi, S. A., & Moghaddam, M. (2012). Multi-site integrated production-distribution planning with trans-shipment: a fuzzy goal programming approach. International Journal of Production Research, 50(6), 1726-1748. doi:10.1080/00207543.2011.560907Zimmermann, H.-J. (1978). Fuzzy programming and linear programming with several objective functions. Fuzzy Sets and Systems, 1(1), 45-55. doi:10.1016/0165-0114(78)90031-