Stochastic lot sizing problem with nervousness considerations
From MaRDI portal
Publication:1652600
DOI10.1016/j.cor.2018.01.021zbMath1391.90016OpenAlexW2791350394MaRDI QIDQ1652600
Hande Yaman, M. Selim Akturk, Esra Koca
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/49854
Semidefinite programming (90C22) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)
Related Items
A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times, Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount, Comparison of different approaches to multistage lot sizing with uncertain demand
Cites Work
- Unnamed Item
- Unnamed Item
- The stochastic lot sizing problem with piecewise linear concave ordering costs
- Stochastic lot-sizing with backlogging: computational complexity analysis
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Lot-sizing on a tree
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- Stochastic linear programs with restricted recourse
- Nervousness in inventory management: Comparison of basic control rules
- Nervousness in inventory control: Analytical results
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- New lot-sizing formulations for less nervous production schedules
- A stochastic production planning problem with nonlinear cost
- Multi-product lot-sizing with a transportation capacity reservation contract
- On solving stochastic production planning problems via scenario modelling
- Dynamic capacitated lot sizing with random demand and dynamic safety stocks
- A survey of scheduling with controllable processing times
- On formulations of the stochastic uncapacitated lot-sizing problem
- Approximate extended formulations
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Lectures on Modern Convex Optimization
- Dynamic Version of the Economic Lot Size Model
- Capacity Acquisition, Subcontracting, and Lot Sizing
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Multi-item capacitated lot-sizing with demand uncertainty
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- Measurement of instability in multi-level MRP systems
- Cutting Planes for Multistage Stochastic Integer Programs
- Integrated capacity, demand, and production planning with subcontracting and overtime options
- Production Planning by Mixed Integer Programming
- The Continuous Mixing Polyhedron
- Mixing mixed-integer inequalities
- Questioning the relative virtues of dynamic lot sizing rules
