Economic lot-sizing problem with remanufacturing option: complexity and algorithms

DOI10.1007/s11590-021-01768-3zbMath1487.90005OpenAlexW3173120682MaRDI QIDQ2115304

Ashwin Arulselvan, Kerem Akartunalı, Wilco van den Heuvel

Publication date: 15 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01768-3

zbMATH Keywords

complexitypolynomial algorithmsremanufacturinglot-sizing

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic uncapacitated lot-sizing problem with co-production
• A computational analysis of lower bounds for big bucket production planning problems
• Economic lot sizing problem with inventory dependent demand
• Dynamic Version of the Economic Lot Size Model
• Dynamic lot sizing with product returns and remanufacturing
• Deterministic Production Planning: Algorithms and Complexity
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

This page was built for publication: Economic lot-sizing problem with remanufacturing option: complexity and algorithms