An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
type: Item
instance of: scholarly article
title: An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
zbMATH Open document ID: 1207.90080
author: Ruiwei Jiang
author: Yongpei Guan
published in: Operations Research Letters
publication date: 2011-03-22T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5869211
zbMATH Keywords: random lead time
zbMATH Keywords: dynamic programming
zbMATH Keywords: stochastic programming
zbMATH Keywords: lot-sizing
MaRDI profile type: Publication
full work available at URL: j.orl.2010.10.004
OpenAlex ID: W2017487410
cites work: Introduction to Stochastic Programming
cites work: On stochastic lot-sizing problems with random lead times
cites work: Q4830009
DOI: 10.1016/J.ORL.2010.10.004
Recommended article: On stochastic lot-sizing problems with random lead times
Recommended article: Approximation algorithms for the stochastic lot-sizing problem with order lead times
Recommended article: Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
Recommended article: A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
Recommended article: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Recommended article: On formulations of the stochastic uncapacitated lot-sizing problem
Recommended article: A capacitated lot sizing problem with stochastic setup times and overtime
Recommended article: The Nonstationary Stochastic Lead-Time Inventory Problem: Near-Myopic Bounds, Heuristics, and Testing
Recommended article: Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
Recommended article: Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
description: scientific article; zbMATH DE number 5869211