Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
From MaRDI portal
Publication:3082694
DOI10.1080/00207720903579013zbMath1207.90010OpenAlexW1965581939MaRDI QIDQ3082694
M. Narenji, S. V. R. Nooraie, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 16 March 2011
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720903579013
Transportation, logistics and supply chain management (90B06) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities, Solving lot-sizing problem with quantity discount and transportation cost
Cites Work
- Unnamed Item
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- Valid inequalities and separation for capacitated economic lot sizing
- Multi-item lot size determination and scheduling under capacity constraints
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Facets and algorithms for capacitated lot sizing
- The single-item lot-sizing problem with immediate lost sales
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- 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
- Improved Algorithms for Economic Lot Size Problems
- Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
