A Transportation Problem with Minimum Quantity Commitment
نویسندگان
چکیده
Full terms and conditions of use:
منابع مشابه
Two-Stage Ordering Policy under Buyer’s Minimum-Commitment Quantity Contract
In this paper we consider a two-stage ordering problem with a buyer’s minimum commitment quantity contract. Under the contract the buyer is required to give a minimum-commitment quantity. Then the manufacturer has the obligations to supply the minimum-commitment quantity and to provide a shortage compensation policy to the buyer. We formulate a dynamic optimization model to determine the manufa...
متن کاملModeling and Analyzing Incremental Quantity Discounts in Transportation Costs for a Joint Economic Lot Sizing Problem
Joint economic lot sizing (JELS) addresses integrated inventory models in a supply chain. Most of the studies in this field either do not consider the role of the transportation cost in their analysis or consider transportation cost as a fixed part of the ordering costs. In this article, a model is developed to analyze an incremental quantity discount in transportation cost. Appropriate equatio...
متن کاملAnalysis of supply contracts with total minimum commitment
In this paper we analyze a supply contract for a single product that speci®es that the cumulative orders placed by a buyer, over a ®nite horizon, be at least as large as a (contracted upon) given quantity. We assume that the demand for the product is uncertain, and the buyer places orders periodically. We derive the optimal purchase policy for the buyer for a given total minimum quantity commit...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Transportation Science
دوره 40 شماره
صفحات -
تاریخ انتشار 2006