A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
type: Item
instance of: scholarly article
title: A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
zbMATH Open document ID: 1390.90408
author: Jianqiang Cheng
author: C. Gicquel
published in: Annals of Operations Research
publication date: 2018-06-12T00:00:00Z
full work available at URL: http://hdl.handle.net/10150/627668
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6886492
zbMATH Keywords: stochastic lot-sizing
zbMATH Keywords: chance-constrained programming
zbMATH Keywords: joint probabilistic constraint
zbMATH Keywords: sample approximation approach
zbMATH Keywords: mixed-integer linear programming
MaRDI profile type: Publication
OpenAlex ID: W2609437715
cites work: A branch and bound method for stochastic integer problems under probabilistic constraints
cites work: Q5766611
cites work: Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: Lot-sizing on a tree
cites work: On formulations of the stochastic uncapacitated lot-sizing problem
cites work: Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
cites work: Modeling industrial lot sizing problems: a review
cites work: On mixing sets arising in chance-constrained programming
cites work: Facets and algorithms for capacitated lot sizing
cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints
cites work: An integer programming approach for linear programs with probabilistic constraints
cites work: Production Planning by Mixed Integer Programming
cites work: Convex Approximations of Chance Constrained Programs
cites work: Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
cites work: On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
cites work: An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
cites work: Dynamic version of the economic lot size model
DOI: 10.1007/S10479-017-2662-5
Recommended article: On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
Recommended article: Multi-item capacitated lot-sizing with demand uncertainty
Recommended article: New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
Recommended article: A note on ``Linear programming models for a stochastic dynamic capacitated lot sizing problem''
Recommended article: A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
Recommended article: A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem
Recommended article: Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
Recommended article: Linear programming models for a stochastic dynamic capacitated lot sizing problem
Recommended article: On formulations of the stochastic uncapacitated lot-sizing problem
Recommended article: A new dynamic programming algorithm for the single item capacitated dynamic lot size model
description: scientific article; zbMATH DE number 6886492