Normative agent-based simulation for supply chain planning

This paper presents an agent-based simulation framework for supply chain (SC) planning, introducing the notion of normative agent. The analysis of the relevant literature shows that most research works carried out in this area aim to handle specific problems and contexts. Although some methodologies and more generic solutions have been proposed, they are not able to cope with SCs in which regulation plays an important role, whether issued by a government agent or by an international institution. Several SCs, such as in the energy, food, chemical, and forestry areas, are highly regulated. Explicitly modelling the actors involved in the regulation of SCs using normative agents allowed us to evaluate the potential benefits of alternative strategies for planning of regulated SCs. The modelling of a biodiesel SC is presented as a case study.     

Multi-commodity supply network planning in the forest supply chain

We consider in this paper a two echelon timber procurement system in which the first echelon consists of multiple harvesting blocks and the second echelon consists of multiple mills (e.g., sawmills), both distributed geographically. Demand is put forward by mills in the form of volumes of logs of specific length and species. Due to the impact of log handling and sorting on cut-to-length harvester and forwarder productivity [Gingras, J.-F., Favreau, J., 2002. Incidence du triage sur la productivité des systèmes par bois tronçonnés. Avantage 3], the harvesting cost per unit volume increases as the number of product variety harvested per block increases. The overall product allocation problem is a large scale mixed integer programming problem with the objective of minimizing combined harvesting and aggregated transportation costs, under demand satisfaction constraints. A heuristic is first introduced then, an algorithm based on the branch-and-price approach is proposed for larger scale problems. Experimentations compare solutions found with the heuristic with the corresponding optimal solutions obtained with both Cplex (using the branch-and-bound approach) and the branch-and-price approach. Results demonstrate the good performance level of the heuristic approach for small scale problems, and of the branch-and-price approach for large scale problems.     

Scheduling coordination problems in supply chain planning

Scheduling algorithms and their role in supply chain planning are topics that have been discussed in scheduling literature for many years. Based on examples and experience with commercial supply chain planning software, this paper presents background information about production planning and scheduling functionality in commercial supply chain planning software and interesting scheduling coordination problems in supply chain planning for researchers. We first provide an overview of different planning activities in supply chain planning, while taking into consideration existing functionalities that are available in commercial supply chain planning software. As a second step, we show three scheduling coordination problems in supply chain planning, namely the integration of production planning and production scheduling, the integration of sales order confirmation and production scheduling and the integration of VMI planning and production scheduling. We conclude this paper with a detailed discussion of an implementation of a supply chain planning solution at the tissue producer SCA Hygiene in Sweden. This paper expresses the authors opinion and does not represent an official statement from SAP.     

Approximation algorithms for supply chain planning and logistics problems with market choice

We propose generalizations of a broad class of traditional supply chain planning and logistics models that we call supply chain planning and logistics problems with market choice. Instead of the traditional setting, we are given a set of markets, each specified by a sequence of demands and associated with a revenue. Decisions are made in two stages. In the first stage, one chooses a subset of markets and rejects the others. Once that market choice is made, one needs to construct a minimum-cost production plan (set of facilities) to satisfy all of the demands of all the selected markets. The goal is to minimize the overall lost revenues of rejected markets and the production (facility opening and connection) costs. These models capture important aspects of demand shaping within supply chain planning and logistics models. We introduce a general algorithmic framework that leverages existing approximation results for the traditional models to obtain corresponding results for their counterpart models with market choice. More specifically, any LP-based α-approximation for the traditional model can be leveraged to a frac11-e^-1/a{frac{1}{1-e^{-1/alpha}}} -approximation algorithm for the counterpart model with market choice. Our techniques are also potentially applicable to other covering problems.     

Multicut Benders decomposition algorithm for process supply chain planning under uncertainty

In this paper, we present a multicut version of the Benders decomposition method for solving two-stage stochastic linear programming problems, including stochastic mixed-integer programs with only continuous recourse (two-stage) variables. The main idea is to add one cut per realization of uncertainty to the master problem in each iteration, that is, as many Benders cuts as the number of scenarios added to the master problem in each iteration. Two examples are presented to illustrate the application of the proposed algorithm. One involves production-transportation planning under demand uncertainty, and the other one involves multiperiod planning of global, multiproduct chemical supply chains under demand and freight rate uncertainty. Computational studies show that while both the standard and the multicut versions of the Benders decomposition method can solve large-scale stochastic programming problems with reasonable computational effort, significant savings in CPU time can be achieved by using the proposed multicut algorithm.     

A robust optimization model for agile and build-to-order supply chain planning under uncertainties

Supply chain planning as one of the most important processes within the supply chain management concept, has a great impact on firms’ success or failure. This paper considers a supply chain planning problem of an agile manufacturing company operating in a build-to-order environment under various kinds of uncertainty. An integrated optimization approach of procurement, production and distribution costs associated with the supply chain members has been taken into account. A robust optimization scenario-based approach is used to absorb the influence of uncertain parameters and variables. The formulation is a robust optimization model with the objective of minimizing the expected total supply chain cost while maintaining customer service level. The developed multi-product, multi-period, multi-echelon robust mixed-integer linear programming model is then solved using the CPLEX optimization studio and guidance related to future areas of research is given.     

Robust solutions and risk measures for a supply chain planning problem under uncertainty

We consider a strategic supply chain planning problem formulated as a two-stage stochastic integer programming (SIP) model. The strategic decisions include site locations, choices of production, packing and distribution lines, and the capacity increment or decrement policies. The SIP model provides a practical representation of real-world discrete resource allocation problems in the presence of future uncertainties which arise due to changes in the business and economic environment. Such models that consider the future scenarios (along with their respective probabilities) not only identify optimal plans for each scenario, but also determine a hedged strategy for all the scenarios. We

1. 1)
   exploit the natural decomposable structure of the SIP problem through Benders’ decomposition,
    
2. 2)
   approximate the probability distribution of the random variables using the generalized lambda distribution, and
    
3. 3)
   through simulations, calculate the performance statistics and the risk measures for the two models, namely the expected-value and the here-and-now.
    

     

Linear programming models with planned lead times for supply chain operations planning

This paper contributes to the development of models for capacity constrained Supply Chain Operations Planning (SCOP). We focus on production environments with arbitrary supply chain structures. The demand for the end items is assumed to be exogenously determined. We solve the SCOP problem with Linear Programming models using planned lead times with multi-period capacity consumption. Using planned lead times increases the reliability of the communication between SCOP and Scheduling with regard to the feasibility of the planning. Planned lead times also reduce the nervousness in the system. We model capacity constraints on the quantity of items that can be assembled within a time interval. In particular, items can be assigned to multiple resources. We discuss two LP approaches which plan the production of items so that a sum of inventory costs and costs due to backordering is minimized.     

Collaborative production planning of supply chain under price and demand uncertainty

This research is motivated by an automobile manufacturing supply chain network. It involves a multi-echelon production system with material supply, component fabrication, manufacturing, and final product distribution activities. We address the production planning issue by considering bill of materials and the trade-offs between inventories, production costs and customer service level. Due to its complexity, an integrated solution framework which combines scatter evolutionary algorithm, fuzzy programming and stochastic chance-constrained programming are combined to jointly take up the issue. We conduct a computational study to evaluate the model. Numerical results using the proposed algorithm confirm the advantage of the integrated planning approach. Compared with other solution methodologies, the supply chain profits from the proposed approach consistently outperform, in some cases up to 13% better. The impacts of uncertainty in demand, material price, and other parameters on the performance of the supply chain are studied through sensitivity analysis. We found the proposed model is effective in developing robust production plans under various market conditions.     

Incorporating demand uncertainty and forecast error in supply chain planning models

This paper develops a framework for examining the effect of demand uncertainty and forecast error on unit costs and customer service levels in the supply chain, including Material Requirements Planning (MRP) type manufacturing systems. The aim is to overcome the methodological limitations and confusion that has arisen in much earlier research. To illustrate the issues, the problem of estimating the value of improving forecasting accuracy for a manufacturer was simulated. The topic is of practical importance because manufacturers spend large sums of money in purchasing and staffing forecasting support systems to achieve more accurate forecasts. In order to estimate the value a two-level MRP system with lot sizing where the product is manufactured for stock was simulated. Final product demand was generated by two commonly occurring stochastic processes and with different variances. Different levels of forecasting error were then introduced to arrive at corresponding values for improving forecasting accuracy. The quantitative estimates of improved accuracy were found to depend on both the demand generating process and the forecasting method. Within this more complete framework, the substantive results confirm earlier research that the best lot sizing rules for the deterministic situation are the worst whenever there is uncertainty in demand. However, size matters, both in the demand uncertainty and forecasting errors. The quantitative differences depend on service level and also the form of demand uncertainty. Unit costs for a given service level increase exponentially as the uncertainty in the demand data increases. The paper also estimates the effects of mis-specification of different sizes of forecast error in addition to demand uncertainty. In those manufacturing problems with high demand uncertainty and high forecast error, improved forecast accuracy should lead to substantial percentage improvements in unit costs. Methodologically, the results demonstrate the need to simulate demand uncertainty and the forecasting process separately.     

An insurance risk management framework for disaster relief and supply chain disruption inventory planning

Government agencies, not-for-profit organizations, and private corporations often assume leading roles in the delivery of supplies, equipment, and manpower to support initial response operations after a disaster strikes. These organizations are faced with challenging logistics decisions to ensure that the right supplies (including equipment and personnel) are in the right places, at the right times, and in the right quantities. Such logistics planning decisions are further complicated by the uncertainties associated with predicting whether or not a potential threat will materialize into an emergency situation. This paper introduces newsvendor variants that account for demand uncertainty as well as the uncertainty surrounding the occurrence of an extreme event. The optimal inventory level is determined and compared to the classic newsvendor solution and the difference is interpreted as the insurance premium associated with proactive disaster-relief planning. The insurance policy framework represents a practical approach for decision makers to quantify the risks and benefits associated with stocking decisions related to preparing for disaster relief efforts or supply chain disruptions.     

An improved stochastic programming model for supply chain planning of MRO spare parts

The maintenance, repair and operation (MRO) spare parts that are vital to machine operations are playing an increasingly important role in manufacturing enterprises. MRO spare parts supply chain management planning must be coordinated to ensure spare part availability while keeping the total cost to a minimum. Due to the specificity of MRO spare parts, randomness and uncertainties in production and storage should be quantified to formulate the problem in a mathematical model. Given these considerations, this paper proposes an improved stochastic programming model for the supply chain planning of MRO spare parts. In our stochastic programming model, the following improvements are made: First, we quantify the uncertain production time capacity as a random variable with a probability distribution. Second, the upper bound of the storage cost is modeled as a multi-choice variable in the constraint. To derive the equivalent deterministic model, the Lagrange interpolating polynomial approach is used. The results of the numerical examples validate the feasibility and efficiency of the proposed model. Finally, the model is tested in the supply chain planning of continuous caster (CC) bearings.     

Tactical supply chain planning models with inherent flexibility: definition and review

Supply chains (SCs) can be managed at many levels. The use of tactical SC planning models with multiple flexibility options can help manage the usual operations efficiently and effectively, whilst improve the SC resiliency in response to inherent environmental uncertainties. This paper defines tactical SC flexibility and identifies tactical flexibility measures and options for development of flexible SC planning models. A classification of the existing literature of SC planning is introduced that highlights the characteristics of published flexibility inclusive models. Additional classifications from the reviewed literature are presented based on the integration of flexibility options used, solution methods utilized, and real world applications presented. These classifications are helpful for identifying research gaps in the current literature and provide insights for future modeling and research efforts in the field.     

A multi-structural framework for adaptive supply chain planning and operations control with structure dynamics considerations

A trend in up-to-date developments in supply chain management (SCM) is to make supply chains more agile, flexible, and responsive. In supply chains, different structures (functional, organizational, informational, financial, etc.) are (re)formed. These structures interrelate with each other and change in dynamics. The paper introduces a new conceptual framework for multi-structural planning and operations of adaptive supply chains with structure dynamics considerations. We elaborate a vision of adaptive supply chain management (A-SCM), a new dynamic model and tools for the planning and control of adaptive supply chains. SCM is addressed from perspectives of execution dynamics under uncertainty. Supply chains are modelled in terms of dynamic multi-structural macro-states, based on simultaneous consideration of the management as a function of both states and structures. The research approach is theoretically based on the combined application of control theory, operations research, and agent-based modelling. The findings suggest constructive ways to implement multi-structural supply chain management and to transit from a “one-way” partial optimization to the feedback-based, closed-loop adaptive supply chain optimization and execution management for value chain adaptability, stability and crisis-resistance. The proposed methodology enhances managerial insight into advanced supply chain management.     

Furniture supply chain tactical planning optimization using a time decomposition approach

We study the supply chain tactical planning problem of an integrated furniture company located in the Province of Québec, Canada. The paper presents a mathematical model for tactical planning of a subset of the supply chain. The decisions concern procurement, inventory, outsourcing and demand allocation policies. The goal is to define manufacturing and logistics policies that will allow the furniture company to have a competitive level of service at minimum cost. We consider planning horizon of 1 year and the time periods are based on weeks. We assume that customer’s demand is known and dynamic over the planning horizon. Supply chain planning is formulated as a large mixed integer programming model. We developed a heuristic using a time decomposition approach in order to obtain good solutions within reasonable time limit for large size problems. Computational results of the heuristic are reported. We also present the quantitative and qualitative results of the application of the mathematical model to a real industrial case.     

Integrating effective flexibility measures into a strategic supply chain planning model

This paper develops models for capacity, product mix, distribution and input supply flexibility and integrates them in a strategic level, mixed integer supply chain (SC) planning model as a way of addressing demand and supply uncertainty, as well as improving market responsiveness. Capacity flexibility is modeled via the SC’s production capacity planning to address budgeted demand and ensure the fulfillment of prospective demand increases when considering various market scenarios. This model selects an optimal number of products from fast moving and extended product range options—based on the product mix flexibility. The model confirms a quick response to a changing marketplace by considering elements like transportation and supply lead time along with the probabilities of stock out options when addressing input supply and distribution flexibility. This paper proposes a solution procedure to solve the model for real world problems, and investigates the sensitivity of the model outputs with respect to changes in flexibility measures.     

Integrated supply chain planning under uncertainty using an improved stochastic approach

This paper proposes an integrated model and a modified solution method for solving supply chain network design problems under uncertainty. The stochastic supply chain network design model is provided as a two-stage stochastic program where the two stages in the decision-making process correspond to the strategic and tactical decisions. The uncertainties are mostly found in the tactical stage because most tactical parameters are not fully known when the strategic decisions have to be made. The main uncertain parameters are the operational costs, the customer demand and capacity of the facilities. In the improved solution method, the sample average approximation technique is integrated with the accelerated Benders’ decomposition approach to improvement of the mixed integer linear programming solution phase. The surrogate constraints method will be utilized to acceleration of the decomposition algorithm. A computational study on randomly generated data sets is presented to highlight the efficiency of the proposed solution method. The computational results show that the modified sample average approximation method effectively expedites the computational procedure in comparison with the original approach.