A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
DOI10.1007/s10479-017-2662-5zbMath1390.90408OpenAlexW2609437715MaRDI QIDQ1639278
Jianqiang Cheng, Celine Gicquel
Publication date: 12 June 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10150/627668
chance-constrained programmingmixed-integer linear programmingjoint probabilistic constraintstochastic lot-sizingsample approximation approach
Mixed integer programming (90C11) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Cites Work
- Unnamed Item
- An integer programming approach for linear programs with probabilistic constraints
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- Lot-sizing on a tree
- An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
- Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
- Uncertain convex programs: randomized solutions and confidence levels
- Facets and algorithms for capacitated lot sizing
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- On mixing sets arising in chance-constrained programming
- On formulations of the stochastic uncapacitated lot-sizing problem
- Dynamic Version of the Economic Lot Size Model
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Modeling industrial lot sizing problems: a review
- Convex Approximations of Chance Constrained Programs
- Production Planning by Mixed Integer Programming
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
This page was built for publication: A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand