Inventory allocation and shipping when demand temporarily exceeds production capacity

We address the concept of an integrated inventory allocation and shipping model for a manufacturer with limited production capacity and multiple types of retailers with different backorder/waiting and delivery costs. The problem is to decide how to allocate and deliver produced items when the total retailer demand exceeds the production capacity, so that total retailer backorder and delivery costs are minimized. Our analytical model provides optimal allocation and shipping policies from the manufacturer’s viewpoint. We also investigate the allocation strategy of a manufacturer competing with other retailers to directly sell to end consumers.     

Analysis of the effectiveness of manufacturer-sponsored retailer gift cards in supply chains

Some manufacturers sponsor “free” retailer gift cards to be given to consumers who purchase their products. These gift cards are paid for by the manufacturer and are redeemable on all products at the retailer. We develop a model of such a supply chain. We analyze cases in which the gift cards’ redemption rate is constant or increasing in gift card value. The results indicate that in addition to the redemption rate and consumers’ valuation for gift card dollars, the profitability of manufacturer-sponsored gift cards depends on the average gross margin of the retailer and the type of purchases consumers make with gift cards. Furthermore, we show that under certain conditions, free gift cards will increase the expected profits of the retailer and manufacturer as well as decrease the retail price of the product. These conditions include a retailer with large average gross margin and consumers using gift cards to purchase products they would not buy with cash otherwise. Furthermore, all consumers, including those who do not redeem the gift card, are more likely to benefit from a reduced retail price when their probability of redeeming the gift card after purchase is equal to their estimated redemption probability at purchase time. We show the conditions under which gift cards are more profitable than cash mail-in rebates. We develop an incentive scheme to improve the performance of supply chains with gift cards.     

Pricing and advertisement in a manufacturer–retailer supply chain

We use a game theoretical approach to study pricing and advertisement decisions in a manufacturer–retailer supply chain when price discounts are offered by both the manufacturer and retailer. When the manufacturer is the leader of the game, we obtained Stackelberg equilibrium with manufacturer’s local allowance, national brand name investment, manufacturer’s preferred price discount, retailer’s price discount, and local advertising expense. For the special case of two-stage equilibrium when the manufacturer’s price discount is exogenous, we found that the retailer is willing to increase local advertising expense if the manufacturer increases local advertising allowance and provides deeper price discount, or if the manufacturer decreases its brand name investment. When both the manufacturer and retailer have power, Nash equilibrium in a competition game is obtained. The comparison between the Nash equilibrium and Stackelberg equilibrium shows that the manufacturer always prefers Stackelberg equilibrium, but there is no definitive conclusion for the retailer. The bargaining power can be used to determine the profit sharing between the manufacturer and the retailer. Once the profit sharing is determined, we suggest a simple contract to help the manufacturer and retailer obtain their desired profit sharing.     

How a dominant retailer might design a purchase contract for a newsvendor-type product with price-sensitive demand

A dominant retailer will purchase a newsvendor-type product from a manufacturer, who incurs a unit manufacturing cost k. The expected retail demand is a function of the unit retail price p. How should the retailer design her purchase contract? For this increasingly prevalent but inadequately studied scenario, we propose plausible adaptations of several contract formats that have been widely studied in the dominant-manufacturer context. For both symmetric-k and asymmetric-k-knowledge situations, we present performance results of these contracts. Our results then reveal that the performance of these contract formats under our scenario differs considerably from what one would surmise from the well-known results published for closely related scenarios. For example, the widely studied buyback and revenue-sharing formats turn out to be largely ineffective when implemented by a dominant retailer. In contrast, the two-part tariff format performs well relative to the theoretically optimal “menu of contracts.” Our results highlight the need to study purchase contract formats designed specifically for dominant-retailer newsvendor-product channels.     

721型分光光度计灯电源电路和稳压电路故障维修

介绍了７２１型分光光度计,灯电源电路和稳压电路故障现象,分析了故障产生的原因,提供了排除故障办法,对该仪器维修提供了借鉴的经验。     

Production scheduling with supply and delivery considerations to minimize the makespan

In this paper we study a scheduling model that simultaneously considers production scheduling, material supply, and product delivery. One vehicle with limited loading capacity transports unprocessed jobs from the supplier’s warehouse to the factory in a fixed travelling time. Another capacitated vehicle travels between the factory and the customer to deliver finished jobs to the customer. The objective is to minimize the arrival time of the last delivered job to the customer. We show that the problem is NP-hard in the strong sense, and propose an O(n) time heuristic with a tight performance bound of 2. We identify some polynomially solvable cases of the problem, and develop heuristics with better performance bounds for some special cases of the problem. Computational results show that all the heuristics are effective in producing optimal or near-optimal solutions quickly.     

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.     

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.     

Calculating safety stocks for assembly systems with random component procurement lead times: A branch and bound algorithm

In this paper, a discrete single-level multi-component inventory control model for assembly systems with random component procurement lead times is considered. The economic order quantity (EOQ) policy is used for a type of finished product. The requirements of the components are constant and cyclic (periodic), and their values per period are deduced from the EOQ for the finished product. The paper focuses on the components safety stock calculation. The objective is to minimise the average holding cost of the components while keeping the desired service level for the finished product. For this, an upper bound, two lower bounds, two dominance properties and an efficient branch and bound algorithm are suggested. Several tests are executed and conclusions are drawn. The proposed model provides a substantial saving for assembly systems with a large number and unreliable delivery of components as in semi-conductor and automotive industries.     

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications

The Economic Order Quantity (EOQ) problem is a fundamental problem in supply and inventory management. In its classical setting, solutions are not affected by the warehouse capacity. We study a type of EOQ problem where the (maximum) warehouse capacity is a decision variable. Furthermore, we assume that the warehouse cost dominates all the other inventory holding costs. We call this the EOQ-Max problem and the D-EOQ-Max problem, if the product is continuously divisible and discrete, respectively. The EOQ-Max problem admits a closed form optimal solution, while the D-EOQ-Max problem does not because its objective function may have several local minima. We present an optimal polynomial time algorithm for the discrete problem. Construction of this algorithm is supported by the fact that continuous relaxation of the D-EOQ-Max problem provides a solution that can be up to 50% worse than the optimal solution, and this worst-case error bound is tight. Applications of the D-EOQ-Max problem include supply and inventory management, logistics and scheduling.