Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
type: Item
instance of: scholarly article
title: Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
author: Fabio Salassa
author: Jully Jeunet
author: F. Della Croce
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350540
zbMATH Keywords: disassembly
zbMATH Keywords: product recovery
zbMATH Keywords: maintenance
zbMATH Keywords: greedy algorithms
zbMATH Keywords: matheuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105151
OpenAlex ID: W3108079975
cites work: A path-relinking approach for a bi-criteria disassembly sequencing problem
cites work: The time buffer approximated buffer allocation problem: a row-column generation approach
cites work: A hybrid heuristic approach for single machine scheduling with release times
cites work: A scatter search approach to the optimum disassembly sequence problem
cites work: Economical evaluation of disassembly operations for recycling, remanufacturing and reuse
cites work: Demand shuffle?A method for multilevel proportional lot sizing and scheduling
cites work: Optimizing disassembly processes subjected to sequence-dependent cost
cites work: Methods for optimum and near optimum disassembly sequencing
cites work: A branch, bound, and remember algorithm for the simple disassembly line balancing problem
cites work: An asynchronous parallel disassembly planning based on genetic algorithm
cites work: Simplified swarm optimization in disassembly sequencing problems with learning effects
DOI: 10.1016/J.COR.2020.105151
description: scientific article; zbMATH DE number 7350540