A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

DOI10.1287/MNSC.38.9.1329MaRDI QIDQ4015264zbMATH OpenOpenAlexFDO

Authors Moustapha Diaby, Harish C. Bahl, Mark H. Karwan, Stanley Zionts

Publication date 12 January 1993

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.38.9.1329

zbMATH Keywords

near-optimal solutionsLagrangean relaxation-based heuristic procedurevery-large-scale capacitated lot-sizing

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Recommendations

• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
• An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem
• A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
• A Lagrange relaxation algorithm for capacitated lot-size problem (CLSP) with minimum lot-size constraint
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• A Lagrangian heuristic for capacitated single item lot sizing problems
• Lagrangean relaxation based heuristics for lot sizing with setup times
• scientific article; zbMATH DE number 1560348

Cited in

(43)

• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• A new algorithm of the CSLLSP in CIMS
• A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem
• The profit maximizing capacitated lot-size (PCLSP) problem
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• Just-in-time planning and lot-sizing
• A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex
• A multi-item inventory model for deteriorating items under inflation and permissible delay in payments with exponential declining demand
• Modeling industrial lot sizing problems: a review
• Predictive search for capacitated multi-item lot sizing problems
• Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
• Capacitated lot-sizing with extensions: a review
• Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set
• A Lagrange relaxation algorithm for capacitated lot-size problem (CLSP) with minimum lot-size constraint
• Economic lot sizing: the capacity reservation model
• Mathematical modelling of purchasing optimization for an MRP system with containerization constraints
• Lot sizing and scheduling -- survey and extensions
• The Optimal Diversity Management Problem
• Lagrangean relaxation based heuristics for lot sizing with setup times
• The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
• Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm
• Modeling and Managing Uncertainty in Process Planning and Scheduling
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• scientific article; zbMATH DE number 446518 (Why is no real title available?)
• Single item lot sizing problems
• A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
• The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
• A Lagrangian heuristic for capacitated single item lot sizing problems
• A capacitated lot sizing problem with stochastic setup times and overtime
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines

This page was built for publication: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

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