A scatter search approach to the optimum disassembly sequence problem
From MaRDI portal
Publication:2581618
DOI10.1016/j.cor.2004.11.018zbMath1087.90045OpenAlexW2064959119MaRDI QIDQ2581618
Belarmino Adenso-Díaz, Beatriz González
Publication date: 10 January 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.11.018
Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)
Related Items (7)
A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches ⋮ An efficient GRASP algorithm for disassembly sequence planning ⋮ A path-relinking approach for a bi-criteria disassembly sequencing problem ⋮ An asynchronous parallel disassembly planning based on genetic algorithm ⋮ Simplified swarm optimization in disassembly sequencing problems with learning effects ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
Uses Software
Cites Work
- Unnamed Item
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Modelling and evaluating product end-of-life options
- Determination of a disassembly strategy
- Optimal disassembly of complex products
- Optimization analysis for recycle-oriented manufacturing systems
- Assembly planning with an ordering genetic algorithm
- Modelling material separation processes in bulk recycling
- Disassembly sequencing: A survey
- Disassembly matrix for disassembly processes of products
This page was built for publication: A scatter search approach to the optimum disassembly sequence problem
