Analysis of bounds for a capacitated single-item lot-sizing problem
From MaRDI portal
Publication:858280
DOI10.1016/j.cor.2005.05.031zbMath1159.90368OpenAlexW2012666872MaRDI QIDQ858280
Jill R. Hardin, Nemhauser, George I., Savelsbergh, Martin W. P.
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
Related Items
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints, A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan, Single-item dynamic lot-sizing problems: an updated survey, A Lagrangian heuristic for capacitated single item lot sizing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Valid inequalities and separation for capacitated economic lot sizing
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Facets and algorithms for capacitated lot sizing
- Dynamic Version of the Economic Lot Size Model
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- Single Machine Scheduling with Release Dates
- An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Computational Complexity of the Capacitated Lot Size Problem
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling Unrelated Machines by Randomized Rounding
- 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
