A Mathematical Model to Improve the Performance of Logistics Network

The role of logistics nowadays is expanding from just providing transportation and warehousing to offering total integrated logistics. To remain competitive in the global market environment, business enterprises need to improve their logistics operations performance. The improvement will be achieved when we can provide a comprehensive analysis and optimize its network performances. In this paper, a mixed integer linier model for optimizing logistics network performance is developed. It provides a single-product multi-period multi-facilities model, as well as the multi-product concept. The problem is modeled in form of a network flow problem with the main objective to minimize total logistics cost. The problem can be solved using commercial linear programming package like CPLEX or LINDO. Even in small case, the solver in Excel may also be used to solve such model

A Mathematical Model to Improve the Performance of Logistics Network

The role of logistics nowadays is expanding from just providing transportation and warehousing to offering total integrated logistics. To remain competitive in the global market environment, business enterprises need to improve their logistics operations performance. The improvement will be achieved when we can provide a comprehensive analysis and optimize its network performances. In this paper, a mixed integer linier model for optimizing logistics network performance is developed. It provides a single-product multi-period multi-facilities model, as well as the multi-product concept. The problem is modeled in form of a network flow problem with the main objective to minimize total logistics cost. The problem can be solved using commercial linear programming package like CPLEX or LINDO. Even in small case, the solver in Excel may also be used to solve such model.Keywords: logistics network, integrated model, mathematical programming, network optimizatio

Optimizing The Global Performance Of Build-to-order Supply Chains

Build-to-order supply chains (BOSCs) have recently received increasing attention due to the shifting focus of manufacturing companies from mass production to mass customization. This shift has generated a growing need for efficient methods to design BOSCs. This research proposes an approach for BOSC design that simultaneously considers multiple performance measures at three stages of a BOSC Tier I suppliers, the focal manufacturing company and Tier I customers (product delivery couriers). We present a heuristic solution approach that constructs the best BOSC configuration through the selection of suppliers, manufacturing resources at the focal company and delivery couriers. The resulting configuration is the one that yields the best global performance relative to five deterministic performance measures simultaneously, some of which are nonlinear. We compare the heuristic results to those from an exact method, and the results show that the proposed approach yields BOSC configurations with near-optimal performance. The absolute deviation in mean performance across all experiments is consistently less than 4%, with a variance less than 0.5%. We propose a second heuristic approach for the stochastic BOSC environment. Compared to the deterministic BOSC performance, experimental results show that optimizing BOSC performance according to stochastic local performance measures can yield a significantly different supply chain configuration. Local optimization means optimizing according to one performance measure independently of the other four. Using Monte Carlo simulation, we test the impact of local performance variability on the global performance of the BOSC. Experimental results show that, as variability of the local performance increases, the mean global performance decreases, while variation in the global performance increases at steeper levels

Models for Flexible Supply Chain Network Design

Arguably Supply Chain Management (SCM) is one of the central problems in Operations Research and Management Science (OR/MS). Supply Chain Network Design (SCND) is one of the most crucial strategic problems in the context of SCM. SCND involves decisions on the number, location, and capacity, of production/distribution facilities of a manufacturing company and/or its suppliers operating in an uncertain environment. Specifically, in the automotive industry, manufacturing companies constantly need to examine and improve their supply chain strategies due to uncertainty in the parameters that impact the design of supply chains. The rise of the Asian markets, introduction of new technologies (hybrid and electric cars), fluctuations in exchange rates, and volatile fuel costs are a few examples of these uncertainties. Therefore, our goal in this dissertation is to investigate the need for accurate quantitative decision support methods for decision makers and to show different applications of OR/MS models in the SCND realm. In the first technical chapter of the dissertation, we proposed a framework that enables the decision makers to systematically incorporate uncertainty in their designs, plan for many plausible future scenarios, and assess the quality of service and robustness of their decisions. Further, we discuss the details of the implementation of our framework for a case study in the automotive industry. Our analysis related to the uncertainty quantification, and network's design performance illustrates the benefits of using our framework in different settings of uncertainty. Although this chapter is focused on our case study in the automotive industry, it can be generalized to the SCND problem in any industry. We have outline the shortcomings of the current literature in incorporating the correlation among design parameters of the supply chains in the second technical chapter. In this chapter, we relax the traditional assumption of knowing the distribution of the uncertain parameters. We develop a methodology based on Distributionally Robust Optimization (DRO) with marginal uncertainty sets to incorporate the correlation among uncertain parameters into the designing process. Further, we propose a delayed generation constraint algorithm to solve the NP-hard correlated model in significantly less time than that required by commercial solvers. Further, we show that the price of ignoring this correlation in the parameters increases when we have less information about the uncertain parameters and that the correlated model gives higher profit when exchange rates are high compared to the stochastic model (with the independence assumption). We extended our models in previous chapters by presenting capacity options as a mechanism to hedge against uncertainty in the input parameters. The concept of capacity options similar to financial options constitute the right, but not the obligation, to buy more commodities from suppliers with a predetermined price, if necessary. In capital-intensive industries like the automotive industry, the lost capital investment for excess capacity and the opportunity costs of underutilized capacity have been important drivers for improving flexibility in supply contracts. Our proposed mechanism for high tooling cost parts decreases the total costs of the SCND and creates flexibility within the structure of the designed SCNs. Moreover, we draw several insights from our numerical analyses and discuss the possibility of price negotiations between suppliers and manufacturers over the hedging fixed costs and variable costs. Overall, the findings from this dissertation contribute to improve the flexibility, reliability, and robustness of the SCNs for a wide-ranging set of industries.PHDIndustrial & Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/145819/1/nsalehi_1.pd

Modeling inventory and responsiveness costs in a supply chain

Evaluation of supply chain performance is often complicated by the various interrelationships that exist within the network of suppliers. Currently many supply chain metrics cannot be analytically determined. Instead, metrics are derived from monitoring historical data, which is commonly referred to as Supply Chain Analytics. With these analytics it is possible to answer questions such as: What is the inventory cost distribution across the chain? What is the actual inventory turnover ratio? What is the cost of demand changes to individual suppliers? However, this approach requires a significant amount of historical data which must be continuously extracted from the associated Enterprise Resources Planning (ERP) system. In this dissertation models are developed for evaluating two Supply Chain metrics, as an alternative to the use of Supply Chain Analytics. First, inventory costs are estimated by supplier in a deterministic (Q , R, δ )2 supply chain. In this arrangement each part has two sequential reorder (R) inventory locations: (i) on the output side of the seller and (ii) on the input side of the buyer. In most cases the inventory policies are not synchronized and as a result the inventory behavior is not easily characterized and tends to exhibit long cycles. This is primarily due to the difference in production rates ( δ), production batch sizes, and the selection of supply order quantities (Q) for logistics convenience. The (Q , R, δ )2 model that is developed is an extension of the joint economic lot size (JELS) model first proposed by Banerjee (1986). JELS is derived as a compromise between the seller\u27s and the buyer\u27s economic lot sizes and therefore attempts to synchronize the supply policy. The (Q , R, δ )2 model is an approximation since it approximates the average inventory behavior across a range of supply cycles. Several supply relationships are considered by capturing the inventory behavior for each supplier in that relationship. For several case studies the joint inventory cost for a supply pair tends to be a stepped convex function. Second, a measure is derived for responsiveness of a supply chain as a function of the expected annual cost of making inventory and production capacity adjustments to account for a series of significant demand change events. Modern supply chains are expected to use changes in production capacity (as opposed to inventory) to react to significant demand changes. Significant demand changes are defined as shifts in market conditions that cannot be buffered by finished product inventory alone and require adjustments in the supply policy. These changes could involve a ± 25% change in the uniform demand level. The research question is what these costs are and how they are being shared within the network of suppliers. The developed measure is applicable in a multi-product supply chain and considers both demand correlations and resource commonality. Finally, the behavior of the two developed metrics is studied as a function of key supply chain parameters (e.g., reorder levels, batch sizes, and demand rate changes). A deterministic simulation model and program was developed for this purpose

Control of Supply Chain Systems by Kanban Mechanism.

This research studies the control mechanism of a supply chain system to operate it efficiently and economically under the just-in-time (JIT) philosophy. To implement a JIT system, kanbans are employed to link different plants\u27 production processes in a supply pipeline. Supply chain models may be categorized into single-stage, multi-stage, and assembly-line types of production systems. In order to operate efficiently and economically, the number of kanbans, the manufacturing batch size, the number of batches, and the total quantity over one period are determined optimally for these types of supply chains. The kanban operation at each stage is scheduled to minimize the total cost in the synchronized logistics of the supply chain. It is difficult to develop a generalized mathematical model for a supply chain system that incorporates all its salient features. This research employs two basic models to describe the supply chain system: a mathematical programming model to minimize the supply chain inventory system cost and a queuing model to configure the kanban logistic operations in the supply pipeline. A supply chain inventory system is modeled as a mixed-integer nonlinear programming (MINLP) that is difficult to solve optimally for a large instance. A branch-and-bound (B&B) method is devised for all versions of it to solve the MINLP problems. From the solution of MINLP, the number of batches in each stage and the total quantity of products are obtained. Next, the number of kanbans that are needed to deliver the batches between two adjacent stages is determined from the results of the MINLP, and kanban operations are fixed to efficiently schedule the dispatches of work-in-process. The new solutions result in a new line configuration as to the number and size of kanbans that led to simpler dispatch schedules, better material handling, reduction in WIP and delivery time, and enhancement of the overall productivity. These models can help a manager respond quickly to consumers\u27 need, determine the right policies to order the raw material and deliver the finished goods, and manage the operations efficiently both within and between the plants

The design of effective and robust supply chain networks

Tableau d’honneur de la Faculté des études supérieures et postdoctorales, 2009-2010Pour faire face aux risques associés aux aléas des opérations normales et aux périls qui menacent les ressources d'un réseau logistique, une méthodologie générique pour le design de réseaux logistiques efficaces et robustes en univers incertain est développée dans cette thèse. Cette méthodologie a pour objectif de proposer une structure de réseau qui assure, de façon durable, la création de valeur pour l'entreprise pour faire face aux aléas et se prémunir contre les risques de ruptures catastrophiques. La méthodologie s'appuie sur le cadre de prise de décision distribué de Schneeweiss et l'approche de modélisation mathématique qui y est associée intègre des éléments de programmation stochastique, d'analyse de risque et de programmation robuste. Trois types d'événements sont définis pour caractériser l'environnement des réseaux logistiques: des événements aléatoires (ex. la demande, les coûts et les taux de changes), des événements hasardeux (ex. les grèves, les discontinuités d'approvisionnement des fournisseurs et les catastrophes naturelles) et des événements profondément incertains (ex. les actes de sabotage, les attentats et les instabilités politiques). La méthodologie considère que l'environnement futur de l'entreprise est anticipé à l'aide de scénarios, générés partiellement par une méthode Monte-Carlo. Cette méthode fait partie de l'approche de solution et permet de générer des replications d'échantillons de petites tailles et de grands échantillons. Elle aide aussi à tenir compte de l'attitude au risque du décideur. L'approche générique de solution du modèle s'appuie sur ces échantillons de scénarios pour générer des designs alternatifs et sur une approche multicritère pour l'évaluation de ces designs. Afin de valider les concepts méthodologiques introduits dans cette thèse, le problème hiérarchique de localisation d'entrepôts et de transport est modélisé comme un programme stochastique avec recours. Premièrement, un modèle incluant une demande aléatoire est utilisé pour valider en partie la modélisation mathématique du problème et étudier, à travers plusieurs anticipations approximatives, la solvabilité du modèle de design. Une approche de solution heuristique est proposée pour ce modèle afin de résoudre des problèmes de taille réelle. Deuxièmement, un modèle incluant les aléas et les périls est utilisé pour valider l'analyse de risque, les stratégies de resilience et l'approche de solution générique. Plusieurs construits mathématiques sont ajoutés au modèle de base afin de refléter différentes stratégies de resilience et proposer un modèle de décision sous risque incluant l'attitude du décideur face aux événements extrêmes. Les nombreuses expérimentations effectuées, avec les données d'un cas réaliste, nous ont permis de tester les concepts proposés dans cette thèse et d'élaborer une méthode de réduction de complexité pour le modèle générique de design sans compromettre la qualité des solutions associées. Les résultats obtenus par ces expérimentations ont pu confirmer la supériorité des designs obtenus en appliquant la méthodologie proposée en termes d'efficacité et de robustesse par rapport à des solutions produites par des approches déterministes ou des modèles simplifiés proposés dans la littérature