A path-relinking approach for a bi-criteria disassembly sequencing problem

DOI10.1016/j.cor.2007.06.002zbMath1278.90041OpenAlexW2071782240MaRDI QIDQ925845

Surendra M. Gupta, Santiago García-Carbajal, Belarmino Adenso-Díaz

Publication date: 23 May 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.06.002

zbMATH Keywords

GRASPreverse logisticspath relinkingmulticriteriadisassembly sequence problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Job-shop production scheduling with reverse flows ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system ⋮ 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

• Scatter Search

Cites Work

• Unnamed Item
• A balancing method and genetic algorithm for disassembly line balancing
• A scatter search approach to the optimum disassembly sequence problem
• An efficient GRASP algorithm for disassembly sequence planning
• Modelling and evaluating product end-of-life options
• Disassembly Modeling for Assembly, Maintenance, Reuse and Recycling
• Scheduling disassembly
• Scatter Search and Path Relinking: Advances and Applications
• Disassembly sequencing: A survey
• Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships

This page was built for publication: A path-relinking approach for a bi-criteria disassembly sequencing problem