A reformulation for the stochastic lot sizing problem with service-level constraints
From MaRDI portal
Publication:1667211
DOI10.1016/J.ORL.2014.01.010zbMATH Open1408.90024OpenAlexW2011086268MaRDI QIDQ1667211FDOQ1667211
Authors: Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Burak Eksioglu 
Publication date: 27 August 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.01.010
Recommendations
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- Formulations for dynamic lot sizing with service levels
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
Cites Work
- Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- Optimal policies for inventory systems with separate delivery-request and order-quantity decisions
- Formulations for dynamic lot sizing with service levels
Cited In (12)
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- Capacitated disassembly scheduling under stochastic yield and demand
- An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
- Single-item dynamic lot-sizing problems: an updated survey
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
- A multiperiod stochastic production planning and sourcing problem with service level constraints
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
- Model formulations for the capacitated lot-sizing problem with service-level constraints
- Formulations for dynamic lot sizing with service levels
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
This page was built for publication: A reformulation for the stochastic lot sizing problem with service-level constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667211)
