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

DOI10.1016/0377-2217(91)90311-IMaRDI QIDQ1178641zbMATH OpenFDO

Authors Juan Larraneta, Luis Onieva, Sebastián Lozano

Publication date 26 June 1992

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

Full work available at URL https://doi.org/10.1016/0377-2217(91)90311-I

zbMATH Keywords

heuristicLagrangean relaxationprimal-dual methodproduction planningsetup timessingle level capacitated dynamic lot-sizing problemsteepest ascent

Mathematics Subject Classification ID

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

Recommendations

• Primal dual approach to the multilevel capacitated lot-sizing problem
• A Lagrangian heuristic for capacitated single item lot sizing problems
• Approximation Formulations for the Single-Product Capacitated Lot Size Problem
• Solving multi-level capacitated lot sizing problems via a fix-and-optimize approach
• A hybrid optimization approach for multi-level capacitated lot-sizing problems
• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
• Analysis of bounds for a capacitated single-item lot-sizing problem
• An efficient algorithm for the capacitated single item dynamic lot size problem
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
• Primal-dual approach to the capacitated production planning problem with concave costs

Cites work

• A Lower Bounding Structure for Lot-Size Scheduling Problems
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• An Efficient Algorithm for Multi-Item Scheduling
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Deterministic Production Planning: Algorithms and Complexity
• Dynamic version of the economic lot size model
• scientific article; zbMATH DE number 3737349 (Why is no real title available?)
• scientific article; zbMATH DE number 3550468 (Why is no real title available?)
• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• scientific article; zbMATH DE number 3573593 (Why is no real title available?)
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Strong Formulations for Multi-Item Capacitated Lot Sizing

Cited in

(12)

• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• Single item lot sizing problems
• scientific article; zbMATH DE number 1560348 (Why is no real title available?)
• A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs
• Primal-dual approach to the capacitated production planning problem with concave costs
• Primal dual approach to the multilevel capacitated lot-sizing problem
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• A coupling cutting stock-lot sizing problem in the paper industry
• Lagrangean relaxation based heuristics for lot sizing with setup times

This page was built for publication: Primal-dual approach to the single level capacitated lot-sizing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178641)