A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
DOI10.1007/s10479-014-1641-3zbMath1350.90009OpenAlexW2034549403MaRDI QIDQ324311
Surendra M. Gupta, Olcay Polat, Can B. Kalayci
Publication date: 11 October 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1641-3
metaheuristicsvariable neighborhood searchdisassemblyhybrid genetic algorithmassemblyreverse supply chainsequence-dependent disassembly line balancing
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
Cites Work
- A balancing method and genetic algorithm for disassembly line balancing
- Variable neighbourhood search: methods and applications
- The sequence-dependent assembly line balancing problem
- Variable neighborhood search
- The application of a tabu search metaheuristic to the assembly line balancing problem
- Balancing assembly lines effectively -- a computational comparison
- Balancing of simple assembly lines under variations of task processing times
- Balancing assembly lines with tabu search
- Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Disassembly line in product recovery
- A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
- Profit-oriented disassembly-line balancing
This page was built for publication: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem