Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands

In many practical applications or multi-item inventory systems significant economies of scale can be exploited when coordinating replenishment orders for groups of items. This paper considers a continuous review multi-item inventory system with compound Poisson demand processes; excess demands are b...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Management science Ročník 30; číslo 3; s. 344 - 357
Hlavní autoři: Federgruen, A, Groenevelt, H, Tijms, H. C
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.03.1984
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edice:Management Science
Témata:
Algorithms
Approximation
Average cost
Carrying costs
compound Poisson demand processes
coordinated replenishments
Coordination
Cost control
Costs
Decision making models
Decision theory
Decomposition
Excess demand
Heuristic
Heuristics
Integers
Inventories
Inventory control
Inventory management
Lead
Lead compounds
Measures
multi-item inventory systems
Order quantity
Poisson process
policy-iteration algorithm
Random variables
service level constraint
ISSN:0025-1909, 1526-5501
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In many practical applications or multi-item inventory systems significant economies of scale can be exploited when coordinating replenishment orders for groups of items. This paper considers a continuous review multi-item inventory system with compound Poisson demand processes; excess demands are backlogged and each replenishment requires a lead time. There is a major setup cost associated with any replenishment of the family of items, and a minor (item dependent) setup cost when including a particular item in this replenishment. Moreover there are holding and penalty costs. We present an algorithm which searches for a simple coordinated control rule minimizing the long-run average cost per unit time subject to a service level constraint per item on the fraction of demand satisfied directly from on-hand inventory. This algorithm is based on a heuristic decomposition procedure and a specialized policy-iteration method to solve the single-item subproblems generated by the decomposition procedure. The model applies to multi-location inventory systems with similar cost structures for coordinated deliveries.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.30.3.344