A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery (Q336916)
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: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery |
scientific article; zbMATH DE number 6650626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery |
scientific article; zbMATH DE number 6650626 |
Statements
A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery (English)
0 references
10 November 2016
0 references
lot-sizing
0 references
product returns
0 references
remanufacturing
0 references
heuristic
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.90330994
0 references
0.8924593
0 references
0.8897995
0 references
0.8897845
0 references
0.88502514
0 references
0.88476455
0 references
0.87764335
0 references
0.8774505
0 references
