A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System (Q4721065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3993274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System |
scientific article; zbMATH DE number 3993274 |
Statements
A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System (English)
0 references
1986
0 references
multi-product, multi-stage production inventory system
0 references
continuous time
0 references
infinite horizon
0 references
long-run average cost
0 references
0.8555341958999634
0 references
0.85248863697052
0 references
0.8390910625457764
0 references
0.8357792496681213
0 references
We study a multi-product, multi-stage production inventory system in continuous time. In-process and finished goods are referred to as products and inventories of a single item held at different locations are treated as different products. External demand can occur for any or all of the products at a constant, product-dependent rate. When an order is placed for a product it is instantly delivered. The set- up cost is a function of the set of products being ordered at that point in time. The goal is to schedule orders for each of the products over an infinite horizon so as to minimize the long-run average cost. We define a new class of policies in which each product uses a stationary interval of time between successive orders, and the ratio of the order intervals of any two products is an integer power of two. We show that there is always a policy in this class that is within 2\% of optimal. This extends a similar result for the one-warehouse, multi-retailer system. For assembly systems we show how to compute such a policy in \(O(N \log N)\) time. For general systems a sequence of max-flow, min-cut computations is required. The algorithm is efficient for very large systems.
0 references