๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The linear dynamic lot size problem with minimum order quantity

โœ Scribed by Irena Okhrin; Knut Richter

Book ID
113655305
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
275 KB
Volume
133
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The dynamic lot size model with quantity
The dynamic lot size model with quantity discount: Counterexamples and correction
โœ Jiefeng Xu; Leonard L. Lu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 34 KB ๐Ÿ‘ 2 views

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.

An optimal procedure for the coordinated
An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
โœ Chia-Shin Chung; Sin-Hoon Hum; Omer Kirca ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 99 KB ๐Ÿ‘ 1 views

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