W e analyze the problem faced by companies that rely on TL (Truckload) and LTL (Less than Truckload) carriers for the distribution of products across their supply chain. Our goal is to design simple inventory policies and transportation strategies to satisfy timevarying demands over a finite horizon, while minimizing systemwide cost by taking advantage of quantity discounts in the transportation cost structures. For this purpose, we study the cost effectiveness of restricting the inventory policies to the class of zero-inventory-ordering (ZIO) policies in a single-warehouse multiretailer scenario in which the warehouse serves as a cross-dock facility. In particular, we demonstrate that there exists a ZIO inventory policy whose total inventory and transportation cost is no more than 4/3 (5.6/4.6 if transportation costs are stationary) times the optimal cost. However, finding the best ZIO policy is an NPhard problem as well. Thus, we propose two algorithms to find an effective ZIO policy: An exact algorithm whose running time is polynomial for any fixed number of retailers, and a linear-programming-based heuristic whose effectiveness is demonstrated in a series of computational experiments. Finally, we extend the worst-case results developed in this paper to systems in which the warehouse does hold inventory.
The Internet is changing the automotive industry as the traditional manufacturer and dealer structure faces increased threats from third party e-tailers. Dynamic pricing together with the Direct-to-Customer business model can be used by manufacturers to respond to these challenges. Indeed, by coordinating production and inventory decisions with dynamic pricing, the automotive industry can increase profits and improve supply chain performance. To illustrate these benefits, we discuss a strategy that incorporates pricing, production scheduling, and inventory control under production capacity limits in a multi-period horizon. We show that under concave revenue curves, a greedy algorithm provides the optimal solution, and we describe extensions to the model such as multiple products sharing production capacity. Using computational analysis, we quantify the profit potential and sales variability due to dynamic pricing, and we suggest that it is possible to achieve significant benefit with few price changes.
We study determining prices and production jointly in a multiple period horizon under a general, nonstationary stochastic demand function with a discrete menu of prices. We assume that the available production capacity is limited and that unmet demand is lost. We incorporate discretionary sales, when inventory may be set aside to satisfy future demand even if some present demand is lost. We analyze and compare partial planning or delayed strategies. In delayed strategies, one decision may be planned in advance, whereas a second decision is delayed until the beginning of each time period, after observing the results of previous decisions. For example, in delayed production (delayed pricing), pricing (production) is determined at the beginning of the horizon, and the production (pricing) decision is made at the beginning of each period before new customer orders are received. A special case is where a single price is chosen over the horizon. We describe policies and heuristics for the strategies based on deterministic approximations and analyze their performances. Computational analysis yields additional insights about the strategies, such as that delayed production is usually better than delayed pricing except sometimes when capacity is tight. On average, the delayed production (pricing) heuristic achieved 99.3% (99.8%) of the corresponding optimal strategy.pricing, production, inventory control, discretionary sales, worst-case analysis
We consider a distribution system consisting of a single warehouse and many geographically dispersed retailers. Each retailer faces demands for a single item which arise at a deterministic, retailer specific rate. The retailers' stock is replenished by a fleet of vehicles of limited capacity, departing and returning to the warehouse and combining deliveries into efficient routes. The cost of any given route consists of a fixed component and a component which is proportional with the total distance driven. Inventory costs are proportional with the stock levels. The objective is to identify a combined inventory policy and a routing strategy minimizing system-wide infinite horizon costs. We characterize the asymptotic effectiveness of the class of so-called Fixed Partition policies and those employing Zero Inventory Ordering. We provide worst case as well as probabilistic bounds under a variety of probabilistic assumptions. This insight is used to construct a very effective algorithm resulting in a Fixed Partition policy which is asymptotically optimal within its class. Computational results show that the algorithm is very effective on a set of randomly generated problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.