×

An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts. (English) Zbl 0976.90003

Summary: 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 needs to be considered as well. The mathematical programming formulation for the incremental discount version of the extended problem and a tighter reformulation of the problem based on variable redefinition are provided. These then serve as the basis for the development of a primal-dual based approach that yields a strong lower bound for our problem. This lower bound is then used in a branch-and-bound scheme to find an optimal solution to the problem. Computational results for this optimal solution procedure are reported in the paper.

MSC:

90B05 Inventory, storage, reservoirs
90B35 Deterministic scheduling theory in operations research
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aksoy, Int J Oper Prod Manage 8 pp 63– (1988)
[2] Benton, Int J Prod Res 29 pp 1953– (1991)
[3] Decision rules for inventory management, Rienhart and Winston, New York, 1967.
[4] Chung, Eur J Oper Res 94 pp 122– (1966)
[5] Eppen, Oper Res 35 pp 832– (1987)
[6] Federgruen, Nav Res Logistics 37 pp 707– (1990)
[7] Goyal, Manage Sci 21 pp 436– (1974)
[8] Kao, Oper Res 27 pp 279– (1979)
[9] Kirca, Nav Res Logistics 42 pp 791– (1995)
[10] Robinson, Manage Sci 42 pp 1556– (1996)
[11] Silver, Nav Res Logistics Quart 26 pp 141– (1979)
[12] Veinott, Oper Res 17 pp 262– (1969)
[13] Zangwill, Oper Res 14 pp 486– (1966)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.