Approximation Formulations for the Single-Product Capacitated Lot Size Problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (22)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
The Focused Factory
1974 • 1,026 citations
Deterministic Production Planning: Algorithms and Complexity
1980 • 597 citations
Computational Complexity of the Capacitated Lot Size Problem
1982 • 527 citations
Integral Boundary Points of Convex Polyhedra
2009 • 367 citations
An Efficient Algorithm for Multi-Item Scheduling
1971 • 268 citations
A Deterministic Multi-Period Production Scheduling Model with Backlogging
1966 • 249 citations
Bounded Production and Inventory Models with Piecewise Concave Costs
1973 • 193 citations
An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
1978 • 169 citations
Integral Extreme Points
1968 • 126 citations
Optimal Inventory Policy with Multiple Set-Up Costs
1969 • 95 citations
Production Planning with Convex Costs: A Parametric Study
1964 • 88 citations
A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
1975 • 85 citations
The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
1987 • 76 citations
A Tutorial on Production Smoothing and Work Force Balancing
1967 • 66 citations
Sequential Production Planning Over Time at Minimum Cost
1957 • 66 citations
The Multiproduct Lot Scheduling Problem
1982 • 47 citations
A Class of Deterministic Production Planning Problems
1973 • 47 citations
A capacity constrained single-facility dynamic lot-size model
1978 • 46 citations
Production planning with time-dependent capacity bounds
1982 • 22 citations
Production Smoothing of Economic Lot Sizes with Non-Decreasing Requirements
1966 • 22 citations
Production Smoothing Under Piecewise Concave Costs, Capacity Constraints and Nondecreasing Requirements
1977 • 11 citations