Primal-dual approach to the single level capacitated lot-sizing problem

DOI10.1016/0377-2217(91)90311-IzbMath0743.90042MaRDI QIDQ1178641

Juan Larraneta, Luis Onieva, Sebastián Lozano

Publication date: 26 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

primal-dual methodLagrangean relaxationproduction planningheuristicsetup timessteepest ascentsingle level capacitated dynamic lot-sizing problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Multi-item capacitated lot-sizing by a cross decomposition based algorithm, A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs, A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, A coupling cutting stock-lot sizing problem in the paper industry, Lagrangean relaxation based heuristics for lot sizing with setup times, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, Single item lot sizing problems

Cites Work

• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Dynamic Version of the Economic Lot Size Model
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Deterministic Production Planning: Algorithms and Complexity
• A Lower Bounding Structure for Lot-Size Scheduling Problems
• An Efficient Algorithm for Multi-Item Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item