A concave-cost production planning problem with remanufacturing options

DOI10.1002/NAV.20089zbMath1072.90011OpenAlexW2152988877MaRDI QIDQ5318285

Jian Yang, Gang Yu, Boaz Golany

Publication date: 22 September 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20089

zbMATH Keywords

heuristicsproduction planningremanufacturing

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (12)

Agile two-stage lot-sizing and scheduling problem with reliability, customer satisfaction and behaviour under uncertainty: a hybrid metaheuristic algorithm ⋮ Uncapacitated production planning with multiple product types, returned product remanufacturing, and demand substitution ⋮ A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery ⋮ Capacitated replenishment and disposal planning for multiple products with resalable returns ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Characteristics of the research on reverse logistics (1995–2005) ⋮ Modeling industrial lot sizing problems: a review ⋮ Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics ⋮ Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints ⋮ Disassembly scheduling: literature review and future research directions ⋮ Robust formulations for economic lot-sizing problem with remanufacturing

This page was built for publication: A concave-cost production planning problem with remanufacturing options