zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The joint replenishment problem with quantity discounts under constant demand. (English) Zbl 1091.90004
Summary: In many practical situations quantity discounts on basic purchase price exist, and taking advantage of these can result in substantial savings. Quantity discounts have been considered in many production and inventory models. But unlike other research areas, there have been no studies to quantity discounts in the joint replenishment problem. The purpose of this paper is to develop efficient algorithms for solving this problem. Firstly, we suggest useful propositions to develop efficient heuristic algorithms. Secondly, we develop two algorithms using these propositions. Numerical examples are shown to illustrate the procedures of these algorithms. Extensive computational experiments are performed to analyze the effectiveness of the heuristics.

90B05Inventory, storage, reservoirs
90C59Approximation methods and heuristics
Full Text: DOI