Economic lot sizing: the capacity reservation model
From MaRDI portal
Publication:2450755
DOI10.1016/j.orl.2013.09.010zbMath1287.90006OpenAlexW2041977003MaRDI QIDQ2450755
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.09.010
Related Items (6)
Subcontracting and lot-sizing with constant capacities ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
Cites Work
- Unnamed Item
- Capacity reservation contracts for high-tech industry
- Lot sizing and scheduling -- survey and extensions
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- Multi-product lot-sizing with a transportation capacity reservation contract
- Dynamic Version of the Economic Lot Size Model
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- Ordering Policies for Periodic-Review Inventory Systems with Quantity-Dependent Fixed Costs
- Optimal Policy for a Periodic-Review Inventory System Under a Supply Capacity Contract
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Improved Algorithms for Economic Lot Size Problems
- An Inventory Model Embedded in Designing a Supply Contract
- Solving the CLSP by a Tabu Search Heuristic
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
This page was built for publication: Economic lot sizing: the capacity reservation model