Capacitated replenishment and disposal planning for multiple products with resalable returns

DOI10.1007/s10479-012-1112-7zbMath1269.90038OpenAlexW2080289413MaRDI QIDQ2393488

Sıla Çetinkaya, Üster, Halit, Elif Akcali, İbrahim Karakayalı

Publication date: 8 August 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1112-7

zbMATH Keywords

Lagrangian relaxationlot sizingclosed-loop supply chainsresalable returnsspare part kitting

Mathematics Subject Classification ID

Production models (90B30)

Related Items

Optimal advance selling strategy with information provision for omni-channel retailers, Principal-agent problem for returns handling in a reverse supply chain with one manufacturer and two competing dealers

Cites Work

• Uncapacitated production planning with multiple product types, returned product remanufacturing, and demand substitution
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Capacitated lot-sizing with extensions: a review
• On optimal inventory control with independent stochastic item returns.
• Remanufacturing planning for the reverse Wagner/Whitin models
• The newsboy problem with resalable returns: a single period model and case study
• Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• A concave-cost production planning problem with remanufacturing options