We consider in this paper the coordinated replenishment dynamic lot-sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts nee
The coordinated replenishment dynamic lot-sizing problem with quantity discounts
โ Scribed by Chia-Shin Chung; Sin-Hoon Hum; Omer Kirca
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 902 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper deals with a dynamic lot size problem in which the unit purchasing price depends on the quantity of an order and resale of the excess is possible at the end of each period. We assume an all units discount system with a single price break point. Investigation of the properties of an optima
In this article we develop a heuristic procedure for a multiproduct dynamic lot-sizing problem. In this problem a joint setup cost is incurred when at least one product is ordered in a period. In addition to the joint setup cost a separate setup cost for each product ordered is also incurred. The ob
Federgruen and Lee ([3] ) proposed an optimal algorithm for the single-item dynamic lot size model with all-unit discount. In this note we show that their algorithm fails to find the optimal solution for some special cases. We also provide a modification to the algorithm to handle them.