Approximate solutions for a stochastic lot-sizing problem with partial customer-order information

DOI10.1016/S0377-2217(02)00488-5zbMath1023.90019MaRDI QIDQ1400665

M. T. Melo, Nico P. Dellaert

Publication date: 13 August 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingstochastic lot-sizing

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (5)

The optimal replenishment policy for time-varying stochastic demand under vendor managed inventory ⋮ Modelling imperfect advance demand information and analysis of optimal inventory policies ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Augmenting the lot sizing order quantity when demand is probabilistic ⋮ A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Production strategies for a stochastic lot-sizing problem with constant capacity
• Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing
• A Dynamic Model for Requirements Planning with Application to Supply Chain Optimization
• On Finding the Maximal Gain for Markov Decision Processes
• On the value of information in dynamic production/inventory problems under forecast evolution
• Customer-Order Information, Leadtimes, and Inventories

This page was built for publication: Approximate solutions for a stochastic lot-sizing problem with partial customer-order information