Type-E disassembly line balancing problem with multi-manned workstations
From MaRDI portal
Publication:779771
DOI10.1007/s11081-019-09465-yzbMath1447.90060OpenAlexW2974761598MaRDI QIDQ779771
Yuchen Li, Ibrahim Kucukkoc, Zixiang Li
Publication date: 14 July 2020
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-019-09465-y
Related Items (6)
An exact solution method for multi-manned disassembly line design with and/or precedence relations ⋮ A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ Balancing of two-sided disassembly lines: problem definition, MILP model and genetic algorithm approach ⋮ A novel constraint programming and simulated annealing for disassembly line balancing problem with and/or precedence and sequence dependent setup times ⋮ Models and two-phase bee algorithms for multi-objective U-shaped disassembly line balancing problem ⋮ Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
Cites Work
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- A balancing method and genetic algorithm for disassembly line balancing
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- 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
- Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
This page was built for publication: Type-E disassembly line balancing problem with multi-manned workstations
