Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
From MaRDI portal
Publication:2027018
DOI10.1016/j.cor.2020.105151OpenAlexW3108079975MaRDI QIDQ2027018
Fabio Salassa, Jully Jeunet, Frederico Della Croce
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105151
Cites Work
- A hybrid heuristic approach for single machine scheduling with release times
- Optimizing disassembly processes subjected to sequence-dependent cost
- A path-relinking approach for a bi-criteria disassembly sequencing problem
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem
- An asynchronous parallel disassembly planning based on genetic algorithm
- Simplified swarm optimization in disassembly sequencing problems with learning effects
- The time buffer approximated buffer allocation problem: a row-column generation approach
- A scatter search approach to the optimum disassembly sequence problem
- Methods for optimum and near optimum disassembly sequencing
- Economical evaluation of disassembly operations for recycling, remanufacturing and reuse
- Demand shuffle?A method for multilevel proportional lot sizing and scheduling
This page was built for publication: Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
