Methods for optimum and near optimum disassembly sequencing

DOI10.1080/00207540601120484zbMath1141.90404OpenAlexW2062598567MaRDI QIDQ3498871

Surendra M. Gupta, Alfred J. D. Lambert

Publication date: 19 May 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540601120484

zbMATH Keywords

optimizationheuristicsmodellingsequencingdisassemblyoperational researchoperations planning

Mathematics Subject Classification ID

Production models (90B30)

Related Items (3)

Capacitated disassembly scheduling under stochastic yield and demand ⋮ An asynchronous parallel disassembly planning based on genetic algorithm ⋮ Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs

Cites Work

• Optimizing disassembly processes subjected to sequence-dependent cost
• Economical evaluation of disassembly operations for recycling, remanufacturing and reuse

This page was built for publication: Methods for optimum and near optimum disassembly sequencing