Virtual transshipments and revenue-sharing contracts in supply chain management

This dissertation presents the use of virtual transshipments and revenue-sharing contracts for inventory control in a small scale supply chain. The main objective is to maximize the total profit in a centralized supply chain or maximize the supply chain\u27s profit while keeping the individual components\u27 incentives in a decentralized supply chain. First, a centralized supply chain with two capacitated manufacturing plants situated in two distinct geographical regions is considered. Normally, demand in each region is mostly satisfied by the local plant. However, if the local plant is understocked while the remote one is overstocked, some of the newly generated demand can be assigned to be served by the more remote plant. The sources of the above virtual lateral transshipments, unlike the ones involved in real lateral transshipments, do not need to have nonnegative inventory levels throughout the transshipment process. Besides the theoretical analysis for this centralized supply chain, a computational study is conducted in detail to illustrate the ability of virtual lateral transshipments to reduce the total cost. The impacts of the parameters (unit holding cost, production cost, goodwill cost, etc.) on the cost savings that can be achieved by using the transshipment option are also assessed. Then, a supply chain with one supplier and one retailer is considered where a revenue-sharing contract is adopted. In this revenue-sharing contract, the retailer may obtain the product from the supplier at a less-than-production-cost price, but in exchange, the retailer must share the revenue with the supplier at a pre-set revenuesharing rate. The objective is to maximize the overall supply chain\u27s total profit while upholding the individual components\u27 incentives. A two-stage Stackelberg game is used for the analysis. In this game, one player is the leader and the other one is the follower. The analysis reveals that the party who keeps more than half of the revenue should also be the leader of the Stackelberg game. Furthermore, the adoption of a revenue-sharing contract in a supply chain with two suppliers and one retailer under a limited amount of available funds is analyzed. Using the revenue-sharing contract, the retailer pays a transfer cost rate of the production cost per unit when he obtains the items from the suppliers, and shares the revenue with the suppliers at a pre-set revenue-sharing rate. The two suppliers have different transfer cost rates and revenue-sharing rates. The retailer will earn more profit per unit with a higher transfer cost rate. How the retailer orders items from the two suppliers to maximize his expected profit under limited available funds is analyzed next. Conditions are shown under which the optimal way the retailer orders items from the two suppliers exists

Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles

"March 13, 1991."Includes bibliographical references (p. 34-36).Supported by the National Science Foundation. DDM-9014751 Supported by a grant from the Draper Laboratories and the UPS Foundation.Dimitris J. Bertsimas, Garrett van Ryzin

Optimal Policy for Production Systems with Two Flexible Resources and TwoProducts

Manufacturing companies are facing increasing volatility in demand. As a result, there has been an emerging need for a flexible multi-period manufacturing system that uses multiple resources to produce multiple products with stochastic demands. To manage such multi-product, multi-resource systems, manufacturers need to make two decisions simultaneously: setting a production quantity for each product and allocating the limited resources dynamically among the products. Unfortunately, although the flexibility design and investment have been extensively studied, the literature has been muted on how to make production and allocation decisions optimally from an operational perspective. This article attempts to fill this literature gap by investigating a multi-period system using multiple flexible resources to produce two products. We identify the structural property of the cost functions, namely ρ-differential monotone. Based on this property, the optimal production and allocation policy can be characterized by switching curves, which divide the state space into eight or nine sub-regions based on the segmentation of decision rules. We analyze different cases in terms of production costs and resource utilization ratios, and show how they affect the optimal production and allocation decisions. Finally, we compare three heuristic policies to the optimal one to display the advantage of resource flexibility and the effectiveness of a heuristic policy. Supplementary materials are available for this article. Go to the publisher’s online edition of IISE Transaction, datasets, additional tables, detailed proofs, etc

Hybrid Heuristics for Infinite Period Inventory Routing Problem

In this paper, we address a one-to-many distribution network inventory routing problem over an infinite planning horizon. Each retailer has an independent, random demand, and the distribution center uses capacitated vehicles for routing delivery. The demand at each retailer is relatively small compared to the vehicle capacity. A novel mathematical model is given to simultaneously decide the optimal routing tours to retailers and routing frequencies of each route. Several heuristics are developed to solve large scale instances of the problem

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

Integrated Supply Chain Network Design: Location, Transportation, Routing and Inventory Decisions

abstract: In this dissertation, an innovative framework for designing a multi-product integrated supply chain network is proposed. Multiple products are shipped from production facilities to retailers through a network of Distribution Centers (DCs). Each retailer has an independent, random demand for multiple products. The particular problem considered in this study also involves mixed-product transshipments between DCs with multiple truck size selection and routing delivery to retailers. Optimally solving such an integrated problem is in general not easy due to its combinatorial nature, especially when transshipments and routing are involved. In order to find out a good solution effectively, a two-phase solution methodology is derived: Phase I solves an integer programming model which includes all the constraints in the original model except that the routings are simplified to direct shipments by using estimated routing cost parameters. Then Phase II model solves the lower level inventory routing problem for each opened DC and its assigned retailers. The accuracy of the estimated routing cost and the effectiveness of the two-phase solution methodology are evaluated, the computational performance is found to be promising. The problem is able to be heuristically solved within a reasonable time frame for a broad range of problem sizes (one hour for the instance of 200 retailers). In addition, a model is generated for a similar network design problem considering direct shipment and consolidation within the same product set opportunities. A genetic algorithm and a specific problem heuristic are designed, tested and compared on several realistic scenarios.Dissertation/ThesisPh.D. Industrial Engineering 201

Dynamic Inventory Control with Satisfaction-Dependent Demand

In this paper, we consider the discrete multiperiod newsvendor dynamic inventory control problem where customers follow a simple satisfaction-based demand process, where their probability of demand depends on whether their demand was satised the last time they demanded a product, and observe the differences between optimal policies and myopic policies which do not directly consider how inventory policies can affect future demand. We conrm the intuitive result that inventory managers should tend to order more than the myopic policy when satised customers are more likely to demand product, and less than the myopic policy when satised customers are less likely to demand. Moreover, we and that, when choosing a fixed order policy, even an empirically myopic solution with perfect demand distribution information will move away from the optimum towards a suboptimal solution.

Models, methods and algorithms for supply chain planning

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.An outline of supply chains and differences in the problem types is given. The motivation for a generic framework is discussed and explored. A conceptual model is presented along with it application to real world situations; and from this a database model is developed. A MIP and CP implementations are presented; along with alternative formulation which can be use to solve the problems. A local search solution algorithm is presented and shown to have significant benefits. Problem instances are presented which are used to validate the generic models, including a large manufacture and distribution problem. This larger problem instance is not only used to explore the implementation of the models presented, but also to explore the practically of the use of alternative formulation and solving techniques within the generic framework and the effectiveness of such methods including the neighbourhood search solving method. A stochastic dimension to the generic framework is explored, and solution techniques for this extension are explored, demonstrating the use of solution analysis to allow problem simplification and better solutions to be found. Finally the local search algorithm is applied to the larger models that arise from inclusion of scenarios, and the methods is demonstrated to be powerful for finding solutions for these large model that were insoluble using the MIP on the same hardware

Value of supplier's capacity information in a two-echelon supply chain

Cataloged from PDF version of article.In traditional supply chain models it is generally assumed that full information is available to all parties involved. Although this seems reasonable, there are cases where chain members are independent agents and possess different levels of information. In this study, we analyze a two-echelon, single supplier-multiple retailers supply chain in a single-period setting where the capacity of the supplier is limited. Embedding the lack of information about the capacity of the supplier in the model, we aim to analyze the reaction of the retailers, compare it with the full-information case, and assess the value of information and the effects of information asymmetry using game theoretic analysis. In our numerical studies, we conclude that the value of information is highly dependent on the capacity conditions and estimates of the retailers, and having information is not necessarily beneficial to the retailers