Stochastic lot sizing problem with nervousness considerations
From MaRDI portal
Recommendations
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- New lot-sizing formulations for less nervous production schedules
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- The stochastic lot sizing problem with piecewise linear concave ordering costs
Cites work
- scientific article; zbMATH DE number 3322720 (Why is no real title available?)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- A stochastic production planning problem with nonlinear cost
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A survey of scheduling with controllable processing times
- Approximate extended formulations
- Capacity acquisition, subcontracting, and lot sizing
- Cutting planes for multistage stochastic integer programs
- Dynamic capacitated lot sizing with random demand and dynamic safety stocks
- Dynamic version of the economic lot size model
- Integrated capacity, demand, and production planning with subcontracting and overtime options
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lot-sizing on a tree
- Measurement of instability in multi-level MRP systems
- Mixing mixed-integer inequalities
- Multi-item capacitated lot-sizing with demand uncertainty
- Multi-product lot-sizing with a transportation capacity reservation contract
- Nervousness in inventory control: Analytical results
- Nervousness in inventory management: Comparison of basic control rules
- Network flows. Theory, algorithms, and applications.
- New lot-sizing formulations for less nervous production schedules
- On formulations of the stochastic uncapacitated lot-sizing problem
- On solving stochastic production planning problems via scenario modelling
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- Production Planning by Mixed Integer Programming
- Questioning the relative virtues of dynamic lot sizing rules
- Stochastic linear programs with restricted recourse
- Stochastic lot-sizing with backlogging: computational complexity analysis
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- The Continuous Mixing Polyhedron
- The stochastic lot sizing problem with piecewise linear concave ordering costs
Cited in
(3)- Comparison of different approaches to multistage lot sizing with uncertain demand
- 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
This page was built for publication: Stochastic lot sizing problem with nervousness considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652600)
