Approximate solutions for a stochastic lot-sizing problem with partial customer-order information
type: Item
instance of: scholarly article
title: Approximate solutions for a stochastic lot-sizing problem with partial customer-order information
zbMATH Open document ID: 1023.90019
DOI: 10.1016/S0377-2217(02)00488-5
author: M. T. Melo
author: Nico Dellaert
published in: European Journal of Operational Research
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 1963896
zbMATH Keywords: stochastic lot-sizing
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
cites work: Q3818786
cites work: Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing
cites work: Production strategies for a stochastic lot-sizing problem with constant capacity
cites work: A dynamic model for requirements planning with application to supply chain optimization
cites work: On the value of information in dynamic production/inventory problems under forecast evolution
cites work: Customer-Order Information, Leadtimes, and Inventories
cites work: On Finding the Maximal Gain for Markov Decision Processes
cites work: Q4851818
cites work: Q3040924
description: scientific article; zbMATH DE number 1963896