Robust formulations for economic lot-sizing problem with remanufacturing

DOI10.1016/J.EJOR.2020.06.016zbMath1487.90006OpenAlexW3036529830MaRDI QIDQ2028886

Agostinho Agra, Öykü Naz Attila, Ashwin Arulselvan, Kerem Akartunalı

Publication date: 3 June 2021

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.016

zbMATH Keywords

integer programmingdecompositionrobust optimizationlot-sizingextended reformulations

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30) Inventory, storage, reservoirs (90B05) Robustness in mathematical programming (90C17)

Related Items (7)

Dynamic lot sizing with stochastic demand timing ⋮ Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ The robust multi-plant capacitated lot-sizing problem ⋮ A robust model for the lot-sizing problem with uncertain demands ⋮ Robust optimization for lot-sizing problems under yield uncertainty

Cites Work

• Unnamed Item
• A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
• Computing robust basestock levels
• A heuristic approach for big bucket multi-level production planning problems
• Uncapacitated lot sizing with backlogging: the convex hull
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
• Capacitated dynamic lot sizing problems in closed-loop supply chain
• Quantitative models for reverse logistics: A review
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
• Single-item dynamic lot-sizing problems: an updated survey
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
• Robust optimization-methodology and applications
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Approximate extended formulations
• A Dynamic Programming Approach for a Class of Robust Optimization Problems
• Theory and Applications of Robust Optimization
• A Robust Optimization Approach to Inventory Theory
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• Dynamic lot sizing with product returns and remanufacturing
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• The Price of Robustness
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
• A concave-cost production planning problem with remanufacturing options
• Production Planning by Mixed Integer Programming

This page was built for publication: Robust formulations for economic lot-sizing problem with remanufacturing