An optimal lot-sizing model for multi-stage series/assembly systems (Q1112717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal lot-sizing model for multi-stage series/assembly systems |
scientific article; zbMATH DE number 4079148
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal lot-sizing model for multi-stage series/assembly systems |
scientific article; zbMATH DE number 4079148 |
Statements
An optimal lot-sizing model for multi-stage series/assembly systems (English)
0 references
1988
0 references
Multi-stage optimal lot-sizing problems are extremely intractable and are classified as hard-problems in the worst case. Research to date on obtaining optimal lot-sizing solutions has been limited to simple and small problems. In this paper, the case of one finished product is considered. Applying the concepts of echelon stock and topology structure, the optimal solutions of multistage series/assembly systems can be obtained by a dynamic programming algorithm which is based upon a pointer method. This algorithm can be applied to both uncapacitated and capacitated series and assembly systems.
0 references
Multi-stage optimal lot-sizing
0 references
one finished product
0 references
echelon stock
0 references
topology structure
0 references
multistage series/assembly systems
0 references
pointer method
0 references
0 references
0 references
0 references
