A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
DOI10.1007/S10479-014-1641-3zbMATH Open1350.90009OpenAlexW2034549403MaRDI QIDQ324311FDOQ324311
Authors: Can B. Kalayci, Olcay Polat, Surendra M. Gupta
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
Recommendations
- A balancing method and genetic algorithm for disassembly line balancing
- An adaptive genetic algorithm-based and AND/OR graph approach for the disassembly line balancing problem
- Balancing of two-sided disassembly lines: problem definition, MILP model and genetic algorithm approach
- A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
- scientific article; zbMATH DE number 7028926
metaheuristicshybrid genetic algorithmvariable neighborhood searchassemblydisassemblyreverse supply chainsequence-dependent disassembly line balancing
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- The sequence-dependent assembly line balancing problem
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
- Balancing of simple assembly lines under variations of task processing times
- 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
- A balancing method and genetic algorithm for disassembly line balancing
- The application of a tabu search metaheuristic to the assembly line balancing problem
- Balancing assembly lines effectively -- a computational comparison
- Balancing assembly lines with tabu search
- Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
Cited In (25)
- A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times
- A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
- A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
- Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations
- An efficient GRASP algorithm for disassembly sequence planning
- Capacitated disassembly scheduling under stochastic yield and demand
- Constraint programming approaches to disassembly line balancing problem with sequencing decisions
- Title not available (Why is that?)
- Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
- A dynamic programming approach to a multi-objective disassembly line balancing problem
- A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
- Balancing of two-sided disassembly lines: problem definition, MILP model and genetic algorithm approach
- An adaptive genetic algorithm-based and AND/OR graph approach for the disassembly line balancing problem
- A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
- A novel constraint programming and simulated annealing for disassembly line balancing problem with and/or precedence and sequence dependent setup times
- Evolutionary algorithms for supply chain management
- Title not available (Why is that?)
- A balancing method and genetic algorithm for disassembly line balancing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Type-E disassembly line balancing problem with multi-manned workstations
- Optimal disassembly sequence generation using a genetic programming
- Models and two-phase bee algorithms for multi-objective U-shaped disassembly line balancing problem
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem
- An efficient hybrid artificial bee colony algorithm for disassembly line balancing problem with sequence-dependent part removal times
This page was built for publication: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324311)