Heuristics for solving disassemble-to-order problems with stochastic yields

DOI10.1007/s00291-005-0007-2zbMath1122.90010OpenAlexW2003666292MaRDI QIDQ850645

Ian M. Langella, Karl Inderfurth

Publication date: 3 November 2006

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-005-0007-2

zbMATH Keywords

heuristicsremanufacturingdisassemblystochastic yields

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Disassembly EOQ models with price-sensitive demands ⋮ Capacitated disassembly scheduling with random demand ⋮ Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times ⋮ Optimal procurement and sampling decisions under stochastic yield of returns in reverse supply chains ⋮ 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
• A two-stage heuristic for disassembly scheduling with assembly product structure
• An overview of heuristic solution methods
• Lot Sizing with Random Yields: A Review
• Experimental evaluation of heuristic optimization algorithms: A tutorial

This page was built for publication: Heuristics for solving disassemble-to-order problems with stochastic yields