Multistage Lot Sizing Problems via Randomized Rounding

DOI10.1287/OPRE.49.4.599.11222MaRDI QIDQ3635024zbMATH OpenOpenAlexFDO

Authors Chung-Piaw Teo, Dimitris Bertsimas

Publication date 3 July 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.49.4.599.11222

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Approximation algorithms for the stochastic lot-sizing problem with order lead times
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
• Improved approximation algorithms for inventory problems
• On stochastic lot-sizing problems with random lead times
• A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System

Cited in

(10)

• Managing procurement and production outsourcing under dynamic prices
• Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule
• The submodular joint replenishment problem
• Approximation algorithms for inventory problems with submodular or routing costs
• Lot Sizing with Randomly Graded Yields
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
• Multiechelon Lot Sizing: New Complexities and Inequalities
• The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
• Integrated supply chain management via randomized rounding
• Designing two-echelon supply networks

This page was built for publication: Multistage Lot Sizing Problems via Randomized Rounding

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