IIE Transactions · 1987 · 37 citations · 12 references
ManagementIndustrial EngineeringOperations ManagementCapacity PlanningOptimizationProduction PlanningCapacity SizingCombinatorial OptimizationInteger ProgrammingLot SizingProduction OptimizationResource OptimizationCapacitated Lot SizingCapacity ConstraintsDeterministic Lot SizingLagrangian OptimizationLagrangian RelaxationMathematical Programming ModelsMulti-item Lot SizingUncapacitated Lot Sizing
Abstract This paper examines a mathematical programming method of accounting for capacity costs for the deterministic, multi-item, single operation lot sizing problem. With the capacity constraints of CLSP removed with Lagrangian relaxation, the problem decomposes into a set of uncapacitated single product lot sizing problems which are solved with dynamic programming. The Lagrangian dual costs are updated by subgradient optimization. Feasible solutions (production plans within the capacity limitations) are constructed with a heuristic smoothing procedure. The dual-cost heuristic gave solutions which were better on average than the other algorithms tested (and was faster than some comparable algorithms).
12
Dynamic Version of the Economic Lot Size Model
Harvey M. Wagner, T. M. Whitin · Management Science · 2004 · 2.1K citations
Management, Industrial Engineering, Operations Management +17
Validation of subgradient optimization
Michael Held, Philip Wolfe, Harlan Crowder · Mathematical Programming · 1974 · 1.4K citations
Capacitated Lot Sizing with Setup Times
William W. Trigeiro, John O. McClain · Management Science · 1989 · 456 citations
Management, Industrial Engineering, Operations Management +17