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

DOI10.1287/MNSC.38.9.1329zbMath0758.90020OpenAlexW2028975336MaRDI QIDQ4015264

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

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) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (31)

Multi-item capacitated lot-sizing by a cross decomposition based algorithm ⋮ Solving large-scale profit maximization capacitated lot-size problems by heuristic methods ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set ⋮ Unnamed Item ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex ⋮ Just-in-Time Planning and Lot-Sizing ⋮ The profit maximizing capacitated lot-size (PCLSP) problem ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Economic lot sizing: the capacity reservation model ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ Multi-level multi-item lot size planning with limited resources and general manufacturing structure. ⋮ LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm ⋮ Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ A multi-item inventory model for deteriorating items under inflation and permissible delay in payments with exponential declining demand ⋮ Mathematical modelling of purchasing optimization for an MRP system with containerization constraints ⋮ Unnamed Item ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs ⋮ Lot sizing and scheduling -- survey and extensions ⋮ GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem ⋮ Single item lot sizing problems ⋮ Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions

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