A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
From MaRDI portal
Publication:4015264
DOI10.1287/mnsc.38.9.1329zbMath0758.90020MaRDI QIDQ4015264
Stanley Zionts, Mark H. Karwan, Moustapha Diaby, Harish C. Bahl
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
near-optimal solutions; Lagrangean relaxation-based heuristic procedure; very-large-scale capacitated lot-sizing
90C06: Large-scale problems in mathematical programming
90C90: Applications of mathematical programming
90C10: Integer programming
90B05: Inventory, storage, reservoirs
90C09: Boolean programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm, Modeling industrial lot sizing problems: a review, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex, Capacitated lot-sizing with extensions: a review, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, A multi-item inventory model for deteriorating items under inflation and permissible delay in payments with exponential declining demand, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, Lot sizing and scheduling -- survey and extensions, Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs, Solving large-scale profit maximization capacitated lot-size problems by heuristic methods, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, The profit maximizing capacitated lot-size (PCLSP) problem, A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Single item lot sizing problems, Unnamed Item, Modeling and Managing Uncertainty in Process Planning and Scheduling
