An efficient GRASP algorithm for disassembly sequence planning

DOI10.1007/s00291-005-0028-xzbMath1146.90327OpenAlexW2078519853MaRDI QIDQ2642304

Sebastián Lozano, Santiago García-Carbajal, Belarmino Adenso-Díaz

Publication date: 20 August 2007

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

Full work available at URL: https://doi.org/10.1007/s00291-005-0028-x

zbMATH Keywords

GRASPReverse logisticsDisassembly sequence

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Automatic derivation of transition matrix for end-of-life decision making ⋮ A path-relinking approach for a bi-criteria disassembly sequencing problem ⋮ An asynchronous parallel disassembly planning based on genetic algorithm

Uses Software

• GRASP

Cites Work

• Environmental integrated production and recycling management
• Greedy randomized adaptive search procedures
• A scatter search approach to the optimum disassembly sequence problem
• Modelling and evaluating product end-of-life options
• Determination of a disassembly strategy
• Optimization analysis for recycle-oriented manufacturing systems
• Assembly planning with an ordering genetic algorithm
• Disassembly analysis for electromechanical products: A graph-based heuristic approach
• Disassembly sequencing: A survey
• Disassembly matrix for disassembly processes of products
• Unnamed Item
• Unnamed Item
• Unnamed Item