Option contracts: a solution for overloading problems in the delivery service supply chain

Owing to the limited service capacity of express delivery providers, most online retailers have to reject many orders during hot selling seasons. In this paper, we consider an express delivery service supply chain consisting of an express delivery provider and an online retailer whereby the selling season includes both regular periods and online sales periods. Utilizing a modified newsvendor model, we derive the express delivery provider’s optimal capacity decision and find that the overloading problem cannot be avoided because delivery service cannot be inventoried. To solve such a problem, we introduce an option contract to coordinate the supply chain. By allowing the online retailer to book the capacity, the express delivery provider can rent capacity from a third party in advance. Results show this approach can mitigate the problem significantly. We also extend our model to a supply chain consisting of a delivery provider and two retailers.     

Synchronization in supply chains: implications for design and management

Supply chain management literature calls for coordination between the different members of the chain. Materials should be moved from one supplier to the next according to a just-in-time schedule. In this paper, we show that for many supply chain configurations, complete synchronization will result in some members of the chain being ‘losers’ in terms of cost. We develop an algorithm for optimal synchronization of supply chains and provide some guidelines for incentive alignment along the supply chain. In developing the model, we use the economic delivery and scheduling problem model and analyze supply chains dealing with single and multiple components. For single-component supply chains, we derive a closed-form expression for the optimal synchronized cycle time. For multi-component supply chains, we develop an algorithm for finding the optimal synchronized cycle time. We test the performance of the algorithm and show that it provides optimal solutions for a wide range of problems. We illustrate the models with numerical examples.     

A fuzzy-based decision support model for monitoring on-time delivery performance: A textile industry case study

This paper investigates uncertainties in complex supply chain situations and proposes a fuzzy-based decision support model for determining the chance of meeting on-time delivery in a complex supply chain environment. It integrates fuzzy logic principles and unitary structure-based supply chain model and enables addressing uncertainties associated with key inputs of on-time delivery performance for effective decision making process. The proposed pragmatic model deals with the fuzziness of the key inputs including, variations in demand forecasting, materials shortages and distribution lead time, and combines a fuzzy reasoning approach for monitoring on-time delivery of finished products. In systematically dealing with the uncertainties of complex supply chains, this model supports the minimizing of business losses that result from penalties and customer dissatisfaction, and the consequent reduced market share. Application of the proposed model is illustrated using a textile industry case study.     

Performance analysis and design of supply chains: a Petri net approach

In this paper, we investigated a dynamic modelling technique for analysing supply chain networks using generalised stochastic Petri nets (GSPNs). The customer order arrival process is assumed to be Poisson and the service processes at the various facilities of the supply chain are assumed to be exponential. Our model takes into account both the procurement process and delivery logistics that exist between any two members of the supply chain. We compare the performance of two production planning and control policies, the make-to-stock and the assemble-to-order systems in terms of total cost which is the sum of inventory carrying cost and cost incurred due to delayed deliveries. We formulate and solve the decoupling point location problem in supply chains as a total relevant cost (sum of inventory carrying cost and the delay costs) minimisation problem. We use the framework of integrated GSPN-queuing network modelling—with the GSPN at the higher level and a generalised queuing network at the lower level—to solve the decoupling point location problem.     

A multi-phase mathematical programming approach for effective supply chain design

A supply chain is an alliance of independent business processes, such as supplier, manufacturing, and distribution processes that perform the critical functions in the order fulfillment process. Effective design and management of supply chains assists in production and delivery of a variety of products at low cost, high quality, and short lead times. Although the importance of supply chain design is emphasized in the literature, few formal decision models have been proposed for this purpose. This paper presents a multi-phase mathematical programming approach for effective supply chain design. More specifically, the methodology develops and applies a combination of multi-criteria efficiency models, based on game theory concepts, and linear and integer programming methods. Model application and insights are detailed through numerical illustrations.     

The value of early order commitment in a two-level supply chain

One approach to supply chain coordination is early order commitment, whereby a retailer commits to purchase a fixed-order quantity at a fixed delivery time before demand uncertainty is resolved. In this paper, we develop an analytical model to quantify the cost savings of an early order commitment in a two-level supply chain where demand is serially correlated. A decision rule is derived to determine whether early order commitment will benefit the supply chain, and accordingly to determine the optimal timing for early commitment. Our results indicate that the supply chain would experience greater savings from early order commitment when – (a) the inventory item receives less value-added activities at the retailer site; (b) the manufacturing lead time is short; (c) demand correlation over time is positive but weak; or (d) the delivery lead time is long (if a condition exists). We also propose a rebate scheme for the supply chain partners to share the gains of practicing early order commitment.     

A rewarding-punishing coordination mechanism based on Trust in a divergent supply chain

Coordination of decentralized supply chains using contract design is a problem that has been widely addressed in the literature. We consider a divergent supply chain including a supplier and several retailers producing fashion products with short sale seasons. The retailers cooperate with the supplier as sales agents; i.e., they work in the framework of revenue sharing contracts. Because of their proximity to the market, retailers can provide more accurate demand forecasts to the supplier that is used to decide on issues such as capacity building and market prices with regard to retailers stiff due dates, different lead times and different price-dependent demand functions. To ensure abundant supply and cope with the demand variability, the retailers have an incentive to exaggerate their private forecast information. In this study, we propose a new rewarding-punishing coordination mechanism based on trust between supply chain tiers, considered as a differentiation factor between honest and deceptive partners. An optimization model is developed as a building block of this mechanism. An approximation method is used to simplify and solve the problem. The model is then implemented using Monte-Carlo simulation in four different situations, according to 10 different strategies for forecast information sharing. The findings from the tests show that the mechanism including trust as a decisional factor performs better than ‘No Trust’ mechanism in all situations. These results suggest that taking into account Trust in designing coordination mechanism may have significant influence on the financial performance of the supply chain.     

Goodwill hunting and profit sharing: Decision-making in a newspaper chain

A generalised equilibrium solution to the stochastic two-echelon newsvendor problem is achievable when formulated in the context of some cooperation and coordination between the primal (retailer) and dual (manufacturer) operators. We build on previous work detailing this equilibrium solution and apply it to the newspaper business. The solution incorporates changes in variability encountered due to promotional activity which extends the efficient frontier. We also consider consequences for profit and goodwill costs of identifying an equilibrium solution when additional income is generated from a source outside of the supply chain, such as advertising. We generalise to the supply chain network where there is some knowledge of demand or supply distributions further up or down the supply chain. We find that the primal–dual formulation and equilibrium solution apply to interactions between components of supply chain networks and illustrate with the transition to the direct distribution of newspapers.     

A robust optimization approach to reduce the bullwhip effect of supply chains with vendor order placement lead time delays in an uncertain environment

Supply chain management is important for companies and organizations to improve their business and enhance competitiveness in the global marketplace. The bullwhip effect problem of supply chain systems with vendor order placement lead time delays in an uncertain environment is addressed in this paper. Among the numerous causes of bullwhip effect, we focus on uncertainties with respect to demand, production process, supply chain structure, inventory policy implementation and especially vendor order placement lead time delays. Minimizing the negative effect of these uncertainties in inducing bullwhip effect creates a need for developing dynamical inventory policy that increases responsiveness to demand and decreases volatility in inventory replenishment. First, a dynamic model of supply chain with above uncertainties is developed. Then, a novel uncertainty-dependent robust inventory control method using inventory position information is proposed. Additionally, the maximum allowable vendor order placement lead time delay that ensures the stability of supply chains and the suppression of bullwhip effect under the proposed inventory control policy is explored and measured. We find that vendor order placement lead time delays do play important role in supply chain dynamics and contribute to its turbulence and volatility. The effectiveness and flexibility of proposed method is verified through simulation study.     

Supply chain scheduling with receiving deadlines and non-linear penalty

We study the operations scheduling problem with delivery deadlines in a three-stage supply chain process consisting of (1) heterogeneous suppliers, (2) capacitated processing centres (PCs), and (3) a network of business customers. The suppliers make and ship semi-finished products to the PCs where products are finalized and packaged before they are shipped to customers. Each business customer has an order quantity to fulfil and a specified delivery date, and the customer network has a required service level so that if the total quantity delivered to the network falls below a given targeted fill rate, a non-linear penalty will apply. Since the PCs are capacitated and both shipping and production operations are non-instantaneous, not all the customer orders may be fulfilled on time. The optimization problem is therefore to select a subset of customers whose orders can be fulfilled on time and a subset of suppliers to ensure the supplies to minimize the total cost, which includes processing cost, shipping cost, cost of unfilled orders (if any), and a non-linear penalty if the target service level is not met. The general version of this problem is difficult because of its combinatorial nature. In this paper, we solve a special case of this problem when the number of PCs equals one, and develop a dynamic programming-based algorithm that identifies the optimal subset of customer orders to be fulfilled under each given utilization level of the PC capacity. We then construct a cost function of a recursive form, and prove that the resulting search algorithm always converges to the optimal solution within pseudo-polynomial time. Two numerical examples are presented to test the computational performance of the proposed algorithm.     

Establishing Nash equilibrium of the manufacturer–supplier game in supply chain management

We study a game model of multi-leader and one-follower in supply chain optimization where n suppliers compete to provide a single product for a manufacturer. We regard the selling price of each supplier as a pre-determined parameter and consider the case that suppliers compete on the basis of delivery frequency to the manufacturer. Each supplier's profit depends not only on its own delivery frequency, but also on other suppliers' frequencies through their impact on manufacturer's purchase allocation to the suppliers. We first solve the follower's (manufacturer's) purchase allocation problem by deducing an explicit formula of its solution. We then formulate the n leaders' (suppliers') game as a generalized Nash game with shared constraints, which is theoretically difficult, but in our case could be solved numerically by converting to a regular variational inequality problem. For the special case that the selling prices of all suppliers are identical, we provide a sufficient and necessary condition for the existence and uniqueness of the Nash equilibrium. An explicit formula of the Nash equilibrium is obtained and its local uniqueness property is proved.     

Inventory competition in a dual-channel supply chain with delivery lead time consideration

Aimed at the inventory competition of perishable products in a dual-channel supply chain with consideration of the delivery lead time in the online direct channel, we extend the Newsvendor model considering stock-out-based consumer switching behavior to include the delivery lead time. We examine the retailer's optimal order quantity decision in the retail channel and the manufacturer's optimal inventory level decision in the online direct channel, explore the manufacturer's optimal delivery lead time decision in the online direct channel, discuss the impact of the product price and consumer switching behavior on the optimal decisions of supply chain members, and compare the optimal decisions between decentralized and centralized scenarios. The results show that, compared with the centralized scenario, at least one of the supply chain members will overstock in the decentralized scenario and that consumers in the online direct channel enjoy a shorter delivery lead time and hence better service in the decentralized scenario. Finally, we present numerical examples to analyze the impact of relevant parameters on the supply chain members’ profits and the supply chain efficiency.     

Understanding supply chain dynamics: A chaos perspective

Variability in orders or inventories in supply chain systems is generally thought to be caused by exogenous random factors such as uncertainties in customer demand or lead time. Studies have shown, however, that orders or inventories may exhibit significant variability even if customer demand and lead time are deterministic. In this paper, we investigate how this class of variability, chaos, may occur in a multi-level supply chain and offer insights into how to manage relevant supply chain factors to eliminate or reduce system chaos. The supply chain is characterized by the classical beer distribution model with some modifications. We observe the supply chain dynamics under the influence of various factors: demand pattern, ordering policy, demand-information sharing, and lead time. Through proper decision-region formation, the effect of various factors on system chaos is investigated using a factorial design. The degree of system chaos is quantified using the Lyapunov exponent across all levels of the supply chain. This study shows that, to reduce the degree of chaos in the supply chain system, the adjustment parameters for both inventory and supply line discrepancies should be more comparable in magnitude. Counter-intuitively, in certain decision regions, sharing demand information can do more harm than good. Similar to the bullwhip effect observed previously in demand, we discover the phenomenon of “chaos-amplification” in inventory across supply chain levels.     

A new VRPPD model and a hybrid heuristic solution approach for e-tailing

We analyze a business model for e-supermarkets to enable multi-product sourcing capacity through co-opetition (collaborative competition). The logistics aspect of our approach is to design and execute a network system where “premium” goods are acquired from vendors at multiple locations in the supply network and delivered to customers. Our specific goals are to: (i) investigate the role of premium product offerings in creating critical mass and profit; (ii) develop a model for the multiple-pickup single-delivery vehicle routing problem in the presence of multiple vendors; and (iii) propose a hybrid solution approach. To solve the problem introduced in this paper, we develop a hybrid metaheuristic approach that uses a Genetic Algorithm for vendor selection and allocation, and a modified savings algorithm for the capacitated VRP with multiple pickup, single delivery and time windows (CVRPMPDTW). The proposed Genetic Algorithm guides the search for optimal vendor pickup location decisions, and for each generated solution in the genetic population, a corresponding CVRPMPDTW is solved using the savings algorithm. We validate our solution approach against published VRPTW solutions and also test our algorithm with Solomon instances modified for CVRPMPDTW.     

Stochastic inventory system with lead time flexibility: offered by a manufacturer/transporter

This paper studies lead time flexibility in a two-stage continuous review supply chain in which the retailer uses the (R, Q) inventory system: when his inventory position reaches R, the retailer places orders with size Q to the manufacturer, who uses a transportation provider to deliver them with different lead time options. According to the contract, the manufacturer is able to expedite or postpone the delivery if the retailer makes such a request. Hence, the retailer has the flexibility to modify the lead time by using the most up-to-date demand information. The optimal lead time policy is found to be a threshold-type policy. The sensitivity analysis also shows that R is much more sensitive to the change of lead time than Q, and thus, the paper is primarily focused on finding optimal R. We also provide a cost approximation which yields unimodal cost in R. Furthermore, we analyze the order crossing problem and derive an upper bound for the probability of order crossing. Finally, we conduct an extensive sensitivity analysis to illustrate the effects of lead time flexibility on supply chain performance and discuss the managerial insights.     

Price discount based on early order commitment in a single manufacturer–multiple retailer supply chain

Early order commitment (EOC) is a strategy for supply chain coordination, wherein the retailer commits to purchasing from a manufacturer a fixed order quantity a few periods in advance of the regular delivery lead time. In this paper, we formulate and analyze the EOC strategy for a decentralized, two-level supply chain consisting of a single manufacturer and multiple retailers, who face external demands that follow an autocorrelated AR(1) process over time. We characterize the special structure of the optimal solutions for the retailers’ EOC periods to minimize the total supply chain cost and discuss the impact of demand parameters and cost parameters. We then develop and compare three solution approaches to solving the optimal solution. Using this optimal cost as the benchmark, we investigate the effectiveness of using the wholesale price-discount scheme for the manufacturer to coordinate this decentralized system. We give numerical examples to show the benefits of EOC to the whole supply chain, examine the efficiency of the discount scheme in general situation, and provide the special conditions when the full coordination is achieved.     

Integrated location and two-echelon inventory network design under uncertainty

In this paper, we propose a two-stage stochastic model to address the design of an integrated location and two-echelon inventory network under uncertainty. The central issue in this problem is to design and operate an effective and efficient multi-echelon supply chain distribution network and to minimize the expected system-wide cost of warehouse location, the allocation of warehouses to retailers, transportation, and two-echelon inventory over an infinite planning horizon. We structure this problem as a two-stage nonlinear discrete optimization problem. The first stage decides the warehouses to open and the second decides the warehouse-retailer assignments and two-echelon inventory replenishment strategies. Our modeling strategy incorporates various probable scenarios in the integrated multi-echelon supply chain distribution network design to identify solutions that minimize the first stage costs plus the expected second stage costs. The two-echelon inventory cost considerations result in a nonlinear objective which we linearize with an exponential number of variables. We solve the problem using column generation. Our computational study indicates that our approach can solve practical problems of moderate-size with up to twenty warehouse candidate locations, eighty retailers, and ten scenarios efficiently.     

Optimizing the economic lot size of a three-stage supply chain with backordering derived without derivatives

Multi-stage supply chain management integration provides a key to successful international business operations. This is because the integrated approach improves the global system performance and cost efficiency. The integrated production inventory models using differential calculus to solve the multi-variable problems are prevalent in operational research. This paper extends the integrated vendor–buyer inventory problem by Yang and Wee [Yang, P.C., Wee, H.M., 2002. The economic lot size of the integrated vendor–buyer system derived without derivatives. Optimal Control Applications and Methods 23, 163–169] to solve the multi-variable problems in the supply chain, and simplifies the solution procedure using a simple algebraic method. As a result, the solution procedure may be easily understood and applied so as to derive the optimal solution.     

A stochastic aggregate production planning model in a green supply chain: Considering flexible lead times,nonlinear purchase and shortage cost functions

In this paper we develop a stochastic programming approach to solve a multi-period multi-product multi-site aggregate production planning problem in a green supply chain for a medium-term planning horizon under the assumption of demand uncertainty. The proposed model has the following features: (i) the majority of supply chain cost parameters are considered; (ii) quantity discounts to encourage the producer to order more from the suppliers in one period, instead of splitting the order into periodical small quantities, are considered; (iii) the interrelationship between lead time and transportation cost is considered, as well as that between lead time and greenhouse gas emission level; (iv) demand uncertainty is assumed to follow a pre-specified distribution function; (v) shortages are penalized by a general multiple breakpoint function, to persuade producers to reduce backorders as much as possible; (vi) some indicators of a green supply chain, such as greenhouse gas emissions and waste management are also incorporated into the model. The proposed model is first a nonlinear mixed integer programming which is converted into a linear one by applying some theoretical and numerical techniques. Due to the convexity of the model, the local solution obtained from linear programming solvers is also the global solution. Finally, a numerical example is presented to demonstrate the validity of the proposed model.     

Environmental supply chain network design using multi-objective fuzzy mathematical programming

The concern about environmental impact of business activities has spurred an interest in designing environmentally conscious supply chains. This paper proposes a multi-objective fuzzy mathematical programming model for designing an environmental supply chain under inherent uncertainty of input data in such problem. The proposed model is able to consider the minimization of multiple environmental impacts beside the traditional cost minimization objective to make a fair balance between them. A life cycle assessment-based (LCA-based) method is applied to assess and quantify the environmental impact of different options for supply chain network configuration. Also, to solve the proposed multi-objective fuzzy optimization model, an interactive fuzzy solution approach is developed. A real industrial case is used to demonstrate the significance and applicability of the developed fuzzy optimization model as well as the usefulness of the proposed solution approach.