Robust formulations for economic lot-sizing problem with remanufacturing
type: Item
instance of: scholarly article
title: Robust formulations for economic lot-sizing problem with remanufacturing
zbMATH Open document ID: 1487.90006
author: Öykü Naz Attila
author: Agostinho Agra
author: Kerem Akartunalı
author: Ashwin Arulselvan
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C17
zbMATH DE Number: 7354097
zbMATH Keywords: integer programming
zbMATH Keywords: lot-sizing
zbMATH Keywords: robust optimization
zbMATH Keywords: extended reformulations
zbMATH Keywords: decomposition
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.06.016
OpenAlex ID: W3036529830
cites work: Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
cites work: A dynamic programming approach for a class of robust optimization problems
cites work: A heuristic approach for big bucket multi-level production planning problems
cites work: Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
cites work: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Robust optimization-methodology and applications
cites work: Theory and Applications of Robust Optimization
cites work: The Price of Robustness
cites work: A Robust Optimization Approach to Inventory Theory
cites work: Computing robust basestock levels
cites work: Single-item dynamic lot-sizing problems: an updated survey
cites work: Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: Quantitative models for reverse logistics: A review
cites work: Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
cites work: Improved lower bounds for the capacitated lot sizing problem with setup times.
cites work: Q4139966
cites work: Uncapacitated lot sizing with backlogging: the convex hull
cites work: Capacitated dynamic lot sizing problems in closed-loop supply chain
cites work: Production Planning by Mixed Integer Programming
cites work: Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: Dynamic lot sizing with product returns and remanufacturing
cites work: Approximate extended formulations
cites work: Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
cites work: A concave-cost production planning problem with remanufacturing options
cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method
DOI: 10.1016/J.EJOR.2020.06.016
description: scientific article; zbMATH DE number 7354097