Analysis of bounds for a capacitated single-item lot-sizing problem
From MaRDI portal
Publication:858280
DOI10.1016/J.COR.2005.05.031zbMATH Open1159.90368OpenAlexW2012666872MaRDI QIDQ858280FDOQ858280
Authors: Jill R. Hardin, G. L. Nemhauser, Martin W. P. Savelsbergh 
Publication date: 9 January 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.031
Recommendations
- Capacitated lot sizing problems with inventory bounds
- An effective algorithm for the capacitated single item lot size problem
- An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Dynamic version of the economic lot size model
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Approximating the throughput of multiple machines in real-time scheduling
- An experimental study of LP-based approximation algorithms for scheduling problems
- Computational Complexity of the Capacitated Lot Size Problem
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Facets and algorithms for capacitated lot sizing
- Single machine scheduling with release dates
- Scheduling Unrelated Machines by Randomized Rounding
- Valid inequalities and separation for capacitated economic lot sizing
Cited In (8)
- Primal-dual approach to the single level capacitated lot-sizing problem
- Single-item dynamic lot-sizing problems: an updated survey
- A computational analysis of lower bounds for big bucket production planning problems
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan
- A Lagrangian heuristic for capacitated single item lot sizing problems
This page was built for publication: Analysis of bounds for a capacitated single-item lot-sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858280)
