A reformulation for the stochastic lot sizing problem with service-level constraints
From MaRDI portal
Publication:1667211
DOI10.1016/j.orl.2014.01.010zbMath1408.90024OpenAlexW2011086268MaRDI QIDQ1667211
Burak Eksioglu, S. Armagan Tarim, Onur A. Kilic, Huseyin Tunc
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
Related Items (4)
Single-item dynamic lot-sizing problems: an updated survey ⋮ An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ Capacitated disassembly scheduling under stochastic yield and demand
Cites Work
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
- 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
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
This page was built for publication: A reformulation for the stochastic lot sizing problem with service-level constraints