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

Inventory models with lateral transshipments : a review

Lateral transshipments within an inventory system are stock movements between locations of the same echelon. These transshipments can be conducted periodically at predetermined points in time to proactively redistribute stock, or they can be used reactively as a method of meeting demand which cannot be satised from stock on hand. The elements of an inventory system considered, e.g. size, cost structures and service level denition, all in uence the best method of transshipping. Models of many dierent systems have been considered. This paper provides a literature review which categorizes the research to date on lateral transshipments, so that these dierences can be understood and gaps within the literature can be identied

An Innovative Business Model for a Multi-echelon Supply Chain Inventory Management Pattern

Nowadays, companies are experimenting novel organizational solutions to efficiently operate in uncertain and highly dynamic scenarios. As a potential solution, this paper proposes a new business model for a multi-echelon Supply Chain inventory management pattern. Specifically, an inventory model with proactive lateral transshipments was developed and subsequently tested carrying out 288 experiments with the aim of assessing transshipments impact on the performance of a two-echelon Supply Chain. The final goal was to investigate the potential reduction of the overall cost of the enterprise and, conversely, whether this approach could promote significant improvements in the level of service, achievable through a more efficient management of resources. The analyses and simulations indicate the use of large batches and/or low-cost products did not demand the necessity of transshipment events. These preliminary findings could be potentially validated and tested in the future considering more complex networks or multiple products

Risk pooling via unidirectional inventory transshipments in a decentralized supply chain

We study risk pooling via unidirectional lateral transshipments between two locations under local decision-making. Unidirectional transshipments can be applicable when cost structures and/or capabilities differ between locations, and it is also a common practice in dual channel supply chains with online and offline sales channels. We show that such a system cannot be coordinated only with varying transshipment prices. The transshipment receiver orders more and the transshipment giver orders less than the respective optimal centralised order quantities. In order to remove this discrepancy, we suggest horizontal coordinationmechanisms by introducing a leftover subsidy for the location providing the transshipments or a shortage subsidy for the location receiving transshipments as well as a combination of shortage and leftover subsidy. Further, we evaluate the impact of network structure by comparing the equilibrium order quantities and profits under the uni- and bidirectional systems as well as a system without transshipments. Since demand correlation is a critical aspect in risk pooling we provide a detailed numerical study to discuss its impact on our findings

Best matching processes in distributed systems

The growing complexity and dynamic behavior of modern manufacturing and service industries along with competitive and globalized markets have gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless of context and application, have a property in common: They all involve certain types of interactions (collaborative, competitive, or both) among their distributed individuals—from clusters of passive sensors and machines to complex networks of computers, intelligent robots, humans, and enterprises. Having this common property, such systems may encounter common challenges in terms of suboptimal interactions and thus poor performance, caused by potential mismatch between individuals. For example, mismatched subassembly parts, vehicles—routes, suppliers—retailers, employees—departments, and products—automated guided vehicles—storage locations may lead to low-quality products, congested roads, unstable supply networks, conflicts, and low service level, respectively. This research refers to this problem as best matching, and investigates it as a major design principle of CCT, the Collaborative Control Theory. The original contribution of this research is to elaborate on the fundamentals of best matching in distributed and collaborative systems, by providing general frameworks for (1) Systematic analysis, inclusive taxonomy, analogical and structural comparison between different matching processes; (2) Specification and formulation of problems, and development of algorithms and protocols for best matching; (3) Validation of the models, algorithms, and protocols through extensive numerical experiments and case studies. The first goal is addressed by investigating matching problems in distributed production, manufacturing, supply, and service systems based on a recently developed reference model, the PRISM Taxonomy of Best Matching. Following the second goal, the identified problems are then formulated as mixed-integer programs. Due to the computational complexity of matching problems, various optimization algorithms are developed for solving different problem instances, including modified genetic algorithms, tabu search, and neighbourhood search heuristics. The dynamic and collaborative/competitive behaviors of matching processes in distributed settings are also formulated and examined through various collaboration, best matching, and task administration protocols. In line with the third goal, four case studies are conducted on various manufacturing, supply, and service systems to highlight the impact of best matching on their operational performance, including service level, utilization, stability, and cost-effectiveness, and validate the computational merits of the developed solution methodologies

Integrating passenger and freight transportation : model formulation and insights

Integrating passenger and freight flows creates attractive business opportunities because the same transportation needs can be met with fewer vehicles and emissions. This paper seeks an integrated solution for the transportation of passenger and freight simultaneously, so that fewer vehicles are required. The newly introduced problem concerns scheduling a set of vehicles to serve the requests such that a part of the journey can be carried out on a scheduled passenger transportation service. We propose an arc-based mixed integer programming formulation for the integrated transportation system. Computational results on a set of instances provide a clear understanding on the benefits of integrating passenger and freight transportation in the current networks, considering multi-modality of traditional passenger-oriented transportation modes, such as taxi, bus, train or tram

A value network development model and implications for innovation and production network management

In managing their value network, firms have to balance current and future value concerns and own and network partners’ concerns. Firms generate immediate value through manufacturing and selling the current generation of products together with other firms in its production network and generate future value by developing a new generation of products with other firms and research institutes in its innovation network. Product innovation and production often take place simultaneously and recurrently. We take the discernible production and innovation activities to occur in co-evolving network layers. We formulate a biplex value network development model that lays out the temporal pattern of production and innovation activities in the value network. We introduce terminology to pinpoint temporal interactions between the innovation and production activities. We study several exemplary complications in the cross-table of inter- and intragenerational interactions versus interactions within and across network layers