Optimizing disassembly processes subjected to sequence-dependent cost

DOI10.1016/j.cor.2005.03.012zbMath1113.90029OpenAlexW2163328610MaRDI QIDQ850299

Alfred J. D. Lambert

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.012

zbMATH Keywords

networkoptimizationmathematical programmingassemblydisassembly planningtraveling salesperson problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (8)

Automatic derivation of transition matrix for end-of-life decision making ⋮ Methods for optimum and near optimum disassembly sequencing ⋮ Optimal design of line replaceable units ⋮ A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products ⋮ Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations ⋮ An asynchronous parallel disassembly planning based on genetic algorithm ⋮ Simplified swarm optimization in disassembly sequencing problems with learning effects ⋮ Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs

Uses Software

• AIMMS

Cites Work

• Optimal disassembly of complex products
• Economical evaluation of disassembly operations for recycling, remanufacturing and reuse
• Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships

This page was built for publication: Optimizing disassembly processes subjected to sequence-dependent cost