Economic lot-sizing problem with remanufacturing option: complexity and algorithms
type: Item
instance of: scholarly article
title: Economic lot-sizing problem with remanufacturing option: complexity and algorithms
zbMATH Open document ID: 1487.90005
author: Ashwin Arulselvan
author: Kerem Akartunalı
author: Wilco van den Heuvel
published in: Optimization Letters
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 7490486
zbMATH Keywords: lot-sizing
zbMATH Keywords: remanufacturing
zbMATH Keywords: complexity
zbMATH Keywords: polynomial algorithms
MaRDI profile type: Publication
full work available at URL: s11590-021-01768-3
OpenAlex ID: W3173120682
cites work: A dynamic uncapacitated lot-sizing problem with co-production
cites work: Q3056948
cites work: A computational analysis of lower bounds for big bucket production planning problems
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Q4198056
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
cites work: Economic lot sizing problem with inventory dependent demand
cites work: Dynamic lot sizing with product returns and remanufacturing
cites work: Q4782696
cites work: Dynamic version of the economic lot size model
DOI: 10.1007/S11590-021-01768-3
description: scientific article; zbMATH DE number 7490486