A SEQUENTIAL ALLOCATION PROBLEM WITH PERISHABLE GOODS
نویسندگان
چکیده
منابع مشابه
Perishable Durable Goods
We examine whether the Coase conjecture [7, 14, 4, 10] is robust against slight ability of commitment of the monopolist not to sell the durable goods to consumers. We quantify the commitment ability in terms of the speed that the durable goods perish, while keeping the time between the o ers small. We demonstrate that the slight commitment capability makes a substantial di erence by constructin...
متن کاملWelfare of Sequential Allocation Mechanisms for Indivisible Goods
Sequential allocation is a simple and attractive mechanism for the allocation of indivisible goods used in a number of real world settings. In sequential allocation, agents pick items according to a policy, the order in which agents take turns. Sequential allocation will return an allocation which is Pareto efficient – no agent can do better without others doing worse. However, sequential alloc...
متن کاملMarkdown money contracts for perishable goods with clearance pricing
It is common in practice that retailers liquidate unsold perishable goods via clearance pricing. Markdown money is frequently used between manufacturers and retailers in such a supply chain setting. It is a form of rebate from a manufacturer to subsidize a retailer’s clearance pricing after the regular season. Two forms of markdown money are percent markdown money, in which the markdown money i...
متن کاملModel and Algorithm of Reliable Location-Routing Problem for Perishable Goods
Based on the characteristics of perishable goods, we extend the location-routing problem with distance constraints by adopting chance constrained goal programming approach to solve the uncertainty and to express the different priority levels of decisions. The random of depot construction costs and vehicle routing travel time is taken into account. Meanwhile, a two-stage genetic algorithm incorp...
متن کاملThe Pickup And Delivery Vehicle Routing Problem For Perishable Goods In Air-Cargo Industry
This vehicle routing problem involves finding a set of trips, one for each vehicle and to pick up known quantities of perishable goods from a set of geographically dispersed suppliers to the cargo terminal of an international airport in south India. The pickup time is based on the deterministic departure time of the flights. The objective of this Vehicle routing problem with Pickup and Delivery...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1981
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.24.202