A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery (Q336916): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650626 / rank
 
Normal rank
Property / zbMATH Keywords
 
lot-sizing
Property / zbMATH Keywords: lot-sizing / rank
 
Normal rank
Property / zbMATH Keywords
 
product returns
Property / zbMATH Keywords: product returns / rank
 
Normal rank
Property / zbMATH Keywords
 
remanufacturing
Property / zbMATH Keywords: remanufacturing / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristic
Property / zbMATH Keywords: heuristic / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank

Revision as of 06:20, 28 June 2023

scientific article
Language Label Description Also known as
English
A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
scientific article

    Statements

    A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery (English)
    0 references
    0 references
    0 references
    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

    Identifiers