Heuristics for demand-driven disassembly planning

DOI10.1016/j.cor.2005.03.013zbMath1109.90012OpenAlexW2032414275MaRDI QIDQ850301

Ian M. Langella

Publication date: 15 November 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.03.013

zbMATH Keywords

heuristicsreverse logisticsdemand-driven disassemblydisassembly planning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (10)

Disassembly EOQ models with price-sensitive demands ⋮ Remanufacturing and pricing decisions with random yield and random demand ⋮ Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times ⋮ A min–max solution to optimise planned lead time in a remanufacturing system ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system ⋮ Disassembly scheduling: literature review and future research directions

Cites Work

• Scheduling disassembly
• Optimization analysis for recycle-oriented manufacturing systems
• Disassembly sequencing: A survey
• Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships
• Unnamed Item

This page was built for publication: Heuristics for demand-driven disassembly planning