Algorithm for turnpike policies in the dynamic lot size model

DOI10.4064/AM-24-1-57-75zbMATH Open0858.90047OpenAlexW102043620WikidataQ114927297 ScholiaQ114927297MaRDI QIDQ4895384FDOQ4895384

Authors: Stanisław Bylka 

Publication date: 3 December 1996

Published in: Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/219152

Recommendations

• Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter
• scientific article; zbMATH DE number 232493
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• A polynomial algorithm for the production/ordering planning problem with limited storage

zbMATH Keywords

batch orderingcapacitated lot sizinglimited backloggingoptimal infinite inverse policyperiodical turnpike policy

Mathematics Subject Classification ID

Dynamic programming (90C39) Inventory, storage, reservoirs (90B05)

This page was built for publication: Algorithm for turnpike policies in the dynamic lot size model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895384)