Development of a new approach for deterministic supply chain network design

This paper proposes a mixed integer linear programming model and solution algorithm for solving supply chain network design problems in deterministic, multi-commodity, single-period contexts. The strategic level of supply chain planning and tactical level planning of supply chain are aggregated to propose an integrated model. The model integrates location and capacity choices for suppliers, plants and warehouses selection, product range assignment and production flows. The open-or-close decisions for the facilities are binary decision variables and the production and transportation flow decisions are continuous decision variables. Consequently, this problem is a binary mixed integer linear programming problem. In this paper, a modified version of Benders’ decomposition is proposed to solve the model. The most difficulty associated with the Benders’ decomposition is the solution of master problem, as in many real-life problems the model will be NP-hard and very time consuming. In the proposed procedure, the master problem will be developed using the surrogate constraints. We show that the main constraints of the master problem can be replaced by the strongest surrogate constraint. The generated problem with the strongest surrogate constraint is a valid relaxation of the main problem. Furthermore, a near-optimal initial solution is generated for a reduction in the number of iterations.     

Competitive facility location on decentralized supply chains

This paper addresses a novel competitive facility location problem about a firm that intends to enter an existing decentralized supply chain comprised of three tiers of players with competition: manufacturers, retailers and consumers. It first proposes a variational inequality for the supply chain network equilibrium model with production capacity constraints, and then employs the logarithmic-quadratic proximal prediction–correction method as a solution algorithm. Based on this model, this paper develops a generic mathematical program with equilibrium constraints for the competitive facility location problem, which can simultaneously determine facility locations of the entering firm and the production levels of these facilities so as to optimize an objective. Subsequently, a hybrid genetic algorithm that incorporates with the logarithmic-quadratic proximal prediction–correction method is developed for solving the proposed mathematical program with an equilibrium constraint. Finally, this paper carries out some numerical examples to evaluate proposed models and solution algorithms.     

Erratum to “A genetic algorithm approach for solving a closed loop supply chain model: A case of battery recycling” [Appl. Math. Modell. 34 (2010) 655–670]

This study analyzes Mixed Integer Linear Program (MILP) proposed by G. Kannan, P. Sasikumar M. Devika, (2010) in their paper titled ‘A genetic algorithm approach for solving a closed loop supply chain model: A case of battery recycling’, Applied Mathematical Modelling, (34, 655–670). The model in Kannan et al. (2010) is found to be inadequate for the problem described. It is erroneous/infeasible in terms of constraints, objective and variables. In this work, we list down the flaws in the published work and propose modifications to rectify the flaws. The revised model is presented and illustrated using hypothetical problems.     

An analysis of production-inventory models with deteriorating items in a two-echelon supply chain

This paper revisits two previous studies that addressed the integrated production–inventory problem for deteriorating items in a two-echelon supply chain, where the item’s deterioration rate is a constant or follows a continuous probability distribution function. The aim of this study is to present an improved solution procedure to determine the delivery lot size and the number of deliveries per production batch cycle that minimizes the total cost of the entire supply chain. The performance of the proposed methodology is illustrated analytically and numerically.     

A note on supply chain coordination for joint determination of order quantity and reorder point using a credit option

Credit options and side payments are two methods suggested for achieving coordination in a two-echelon supply chain. We examine the credit option coordination mechanism introduced by Chaharsooghi and Heydari [Chaharsooghi, S., & Heydari, J. (2010). Supply chain coordination for the joint determination of order quantity and reorder point using credit option. European Journal of Operational Research, 204(1), 86–95]. This method assumes that the supplier’s opportunity costs are equal to the reduction in the buyer’s financial holding costs during the credit period. In this note, we show that Chaharsooghi and Heydari’s method is not applicable when buyer and supplier opportunity costs are not equal. We introduce an alternate per order rebate method that reduces supply chain costs to centralized management levels.     

Integrated inventory models considering the two-level trade credit policy and a price-negotiation scheme

This paper develops the integrated inventory models with permissible delay in payment, in which customers’ demand is sensitive to the buyer’s price. The models consider the two-level trade credit policy in the vendor–buyer and buyer–customer relationships in supply chain management. A simple recursive solution procedure is proposed for the integrated models to determine the buyer’s optimal pricing and production/order strategy. Although the total profit from the buyer and vendor increases together, the buyer’s share lessens. To compensate the buyer’s loss due to the cooperative relationship, a negotiation system is presented in order to allocate the profit increase to the vendor and buyer to determine the pricing and production/order strategy. A numerical example and sensitivity analysis are provided to illustrate the proposed model. The results indicate that the total profit from the buyer and vendor together can increase, although a price discount is given to the buyer in the proposed models.     

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.     

An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects

We present an algorithmic framework, so-called BFC-TSMIP, for solving two-stage stochastic mixed 0–1 problems. The constraints in the Deterministic Equivalent Model have 0–1 variables and continuous variables at any stage. The approach uses the Twin Node Family (TNF) concept within an adaptation of the algorithmic framework so-called Branch-and-Fix Coordination for satisfying the nonanticipativity constraints for the first stage 0–1 variables. Jointly we solve the mixed 0–1 submodels defined at each TNF integer set for satisfying the nonanticipativity constraints for the first stage continuous variables. In these submodels the only integer variables are the second stage 0–1 variables. A numerical example and some theoretical and computational results are presented to show the performance of the proposed approach.     

Optimizing an objective function under a bivariate probability model

The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probability distribution functions that may be dependent. This method is applicable when results need to be offered in an analytical closed form without double integrals. However, the study only applies to cases where the correlation coefficient between the two variables is positive or null. A stochastic, stationary objective function, involving a single decision variable in a quadratic form is studied. We use a primitive of a bivariate exponential distribution as first expressed by Downton [Downton, F., 1970. Bivariate exponential distributions in reliability theory. Journal of Royal Statistical Society B 32, 408–417] and revisited in Iliopoulos [Iliopoulos, George., 2003. Estimation of parametric functions in Downton’s bivariate exponential distribution. Journal of statistical planning and inference 117, 169–184]. With this primitive, optimization of objective functions in Operations Research, supply chain management or any other setting involving two random variables, or calculations which involve evaluating conditional expectations of two joint random variables are direct. We believe the results can be extended to other cases where exponential bivariates are encountered in economic objective function evaluations. Computation algorithms are offered which substantially reduce computation time when solving numerical examples.     

Internal supply chain coordination in the electric utility industry

Electric utilities have a well-established vertical internal and external supply chain. Theoretically, information sharing, involving production, inventory, and other policy variables, between chain entities can improve supply chain performance. Such sharing relies on a systematic determination of the optimal policy variables for the chain. This paper presents an analysis of the electric utility’s decision problem based on an optimal control model in a competitive market environment. Optimal production and inventory policies are developed for a centralized supply chain under full information sharing. The model and policies are tested with electric utility industry data, and performance implications are discussed for electric utility managers and public regulators.     

Mean–variance analysis of a single supplier and retailer supply chain under a returns policy

In the literature, most of the supply chain coordinating policies target at improving the supply chain’s efficiency in terms of expected cost reduction or expected profit improvement. However, optimizing the expected performance alone cannot guarantee that the realized performance measure will fall within a small neighborhood of its expected value when the corresponding variance is high. Moreover, it ignores the risk aversion of supply chain members which may affect the achievability of channel coordination. As a result, we carry out in this paper a mean–variance (MV) analysis of supply chains under a returns policy. We first propose an MV formulation for a single supplier single retailer supply chain with a newsvendor type of product. The objective of each supply chain decision maker is to maximize the expected profit such that the standard deviation of profit is under the decision maker’s control. We study both the cases with centralized and decentralized supply chains. We illustrate how a returns policy can be applied for managing the supply chains to address the issues such as channel coordination and risk control. Extensive numerical studies are conducted and managerial findings are proposed.     

Goodwill,inventory penalty,and adaptive supply chain management

Information visibility is generally useful for decision makers distributed across supply chains. Availability of information on inventory levels, price, lead times, demand, etc. can help reduce uncertainties as well as alleviate problems associated with bullwhip effect. A majority of extant literature in this area assume a static supply chain network configuration. While this was sufficient a few decades ago, advances in e-commerce and the ease with which order processing can be performed over the Internet necessitates appropriate dynamic (re)configuration of supply chains over time. Each node in the supply chain is modeled as an actor who makes independent decisions based on information gathered from the next level upstream. A knowledge-based framework is used for dynamic supply chain configuration and to consider the effects of inventory constraints and ‘goodwill,’ as well as their effects on the performance dynamics of supply chains. Preliminary results indicate that neither static nor dynamic configurations are consistently dominant. Scenarios where static configurations perform better than the modeled system are identified.     

A two-echelon supply chain of a returnable product with fuzzy demand

This study investigates the effects of the manufacturer’s refund on retailer’s unsold products for the two-echelon decentralized and centralized supply chains of a short life and returnable product with trapezoidal fuzzy demand, in which retailer returns the unsold and the customer’s unsatisfactory products to the manufacturer. For each returnable chain, we obtain the closed-form solution of order quantity to maximize the total expected profit of the supply chain, and confirm that demand fuzziness does indeed affect the order quantity and the members’ expected profits. We provide a number of managerial insights by comparing both chains and show that each chain is more advantageous to the members depending on certain condition. Our models are appropriate for a supply chain with a returnable product that lacks information about the demand.     

Teaching scenario planning: Lessons from practice in academe and business

In this paper, we engage with O’Brien’s [O’Brien, F.A., 2004. Scenario planning – lessons for practice from teaching and learning. European Journal of Operational Research 152, 709–722] identification of both pitfalls in teaching scenario planning and proposed remedies for these. We consider these remedies in relation to our own experience – based on our practice in both the academic and business arenas – and we highlight further pitfalls and proposed remedies. Finally, we propose the use of “hard” multi-attribute decision analysis as a complement to “soft” scenario planning, in order to allow a more formal method of strategy evaluation against a range of constructed scenarios, This approach is intended to remedy biases that are associated with holistic evaluations – such as lexicographic ranking – where undue attention is paid to particular strategic objectives at the expense of others. From this discussion, we seek to contribute to cumulative refinement of the scenario process.     

Predicting retailer orders with POS and order data: The inventory balance effect

Despite advances in retail point-of-sale (POS) data sharing, retailers’ suppliers struggle to effectively use POS data to improve their fulfillment planning processes. The challenge lies in predicting retailer orders. We present evidence that retail echelon inventory processes translate into a long-run balance or equilibrium between orders and POS, which we refer to as the inventory balance effect, allowing for more accurate order forecasting. Based on the inventory balance effect, this research prescribes a forecasting approach which simultaneously uses both sources of information (retailer order history and POS data) to predict retailer orders to suppliers. Using data from a consumable product category, this approach is shown to outperform approaches based singularly on order or POS data, by up to 125%. The strength of this novel approach – significantly improved forecast accuracy with minimal additional analysis – make it a candidate for widespread adoption in retail supply chain collaborative planning and forecasting initiatives with corresponding impact on fulfillment performance and related operating costs.     

Optimal production and shipment models for a single-vendor–single-buyer integrated system

This paper develops a more general production-inventory model for a single-vendor–single-buyer integrated system. Unlike the hitherto existing production-inventory models for the vendor–buyer system, the present model neither requires the buyer’s unit holding cost greater than the vendor’s nor assumes the structure of shipment policy. Secondly, the model is extended to the situation with shortages permitted, based on shortages being allowed to occur only for the buyer. Thirdly, the paper also presents a corresponding production-inventory model for a deteriorating item for the integrated system. The solution procedures are provided for finding the optimal production and shipment policies and illustrated with numerical examples. Three significant insights are shown: (1) no matter whether the buyer’s unit holding cost is greater than the vendor’s or not, the present model always performs best in reducing the average total cost as compared to the hitherto existing models; (2) if the buyer’s unit holding cost is less than the vendor’s, the optimal shipment policy for the integrated system will only comprise shipments with successive shipment sizes increasing by a fixed factor. It is different from that obtained by Hill [Hill, R.M., 1999. The optimal production and shipment policy for the single-vendor single-buyer integrated production-inventory problem. International Journal of Production Research 37, 2463–2475] for the opposite case; (3) when designing a single-vendor–single-buyer integrated system, making the buyer’s unit holding cost lower than the vendor’s is more beneficial to the system if shortages are not permitted to occur; otherwise it just reverses.     

A dynamic model of supplier switching

While a broad branch of literature deals with the development of buyer–supplier relationships, limited research exists under which circumstances a buyer should terminate such a relationship and switch to a new supplier. Recently, Wagner and Friedl (2007) have developed a framework to analyze a static one-shot supplier switching decision when the buyer has asymmetric information about the supplier’s production costs. We extend their basic framework to a dynamic one, assuming that the supplier learns the production costs over time when he sets up the production process. Since the supplier’s cost information at the individual stages crucially determines the setup and the switching decision, it becomes essential for supply chain management to provide proper incentives so that the supplier reveals his cost information truthfully over time. We characterize the optimal setup and switching strategy as well as the optimal supply chain contract. We also compare our findings with those of the static setting to provide further insights.     

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.     

Planning the production of a fleet of domestic combined heat and power generators

This paper describes a planning problem, arising in the energy supply chain, that deals with the planning of the production runs of micro combined heat and power (microCHP) appliances installed in houses, cooperating in a fleet. Two types of this problem are described. The first one is the Single House Planning Problem (SHPP), where the focus is on supplying heat in the household. The second one combines many microCHPs into a Fleet Planning Problem (FPP) and focuses on the mutual electricity output, while still considering the local heat demand in the individual households. The problem is modeled as an ILP. For practical use a local search method is developed for the FPP, based on a dynamic programming formulation of the SHPP.     

A two-phase ant colony algorithm for multi-echelon defective supply chain network design

Supply chain system is an integrated production system of a product. In the past researches, this system was often assumed to be an equilibrium structure, but in real production process, some members in this system usually cannot effectively complete their production task because of the losses of production, which will reduce the performance of the whole supply chain production system. This supply chain with the losses of production is called the defective supply chain (DSC) system. This research will discuss the partner selection and the production–distribution planning in this DSC network system. Besides the cost of production and transportation, the reliability of the structure and the unbalance of this system caused by the losses of production are considered. Then a germane mathematical programming model is developed for solving this problem. Due to the complex problem and in order to get a satisfactory near-optimal solution with great speed, this research proposes seeking the solution with the solving model based on ant colony algorithm. The application results in real cases show that the solving model presented by this research can quickly and effectively plan the most suitable type of the DSC network and decision-making of the production–distribution. Finally, a comparative numerical experiment is performed by using the proposed approach and the common single-phase ant colony algorithm (SAC) to demonstrate the performance of the proposed approach. The analysis results show that the proposed approach can outperform the SAC in partner selection and production–distribution planning for DSC network design.