Discrete multi-module capacitated lot-sizing problems with multiple items
From MaRDI portal
Publication:2670496
DOI10.1016/j.orl.2022.01.002OpenAlexW4205539366MaRDI QIDQ2670496
Kartik Kulkarni, Manish Bansal
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10919/108782
dynamic programmingfixed-parameter tractable algorithmconcave production and holding costsmulti-item discrete lot-sizing problemmulti-module capacitated lot-sizing with backlogging
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete lot-sizing and scheduling problem
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Single-item dynamic lot-sizing problems: an updated survey
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Parametrized complexity theory.
- Lot Sizing with Piecewise Concave Production Costs
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Cutting Planes for Multistage Stochastic Integer Programs
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- Production Planning by Mixed Integer Programming
- Mixing mixed-integer inequalities
