zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
A stochastic programming based inventory policy for assemble-to-order systems with application to the W model. (English) Zbl 1231.90026
Summary: We consider assemble-to-order inventory systems with identical component lead times. We use a stochastic program (SP) to develop an inventory strategy that allows preferential component allocation for minimizing total inventory cost. We prove that the solution of a relaxation of this SP provides a lower bound on total inventory cost for all feasible policies. We demonstrate and test our approach on the W system, which involves three components used to produce two products. (There are two unique parts and a common part. Each product uses the common part and its own unique part.) For the W system, we develop efficient solution procedures for the SP as well as the relaxed SP. We define a simple priority allocation policy that mimics the second-stage SP recourse solution and set base-stock levels according to the first-stage SP solution. We show that our policy achieves the lower bound and is, thus, optimal in two situations: when a certain symmetry condition in the cost parameters holds and when the SP solution satisfies a “balanced capacity” condition. For other cases, numerical results demonstrate that our policy works well and outperforms alternative approaches in many circumstances.

MSC:
90B05Inventory, storage, reservoirs
90C15Stochastic programming