Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
From MaRDI portal
Publication:5444547
DOI10.1080/00207540701476281zbMath1128.90412OpenAlexW1977175513MaRDI QIDQ5444547
Surendra M. Gupta, Seamus M. McGovern
Publication date: 25 February 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701476281
Related Items
An efficient hybrid artificial bee colony algorithm for disassembly line balancing problem with sequence-dependent part removal times ⋮ A disassembly line balancing problem with fixed number of workstations ⋮ A sample average approximation method for disassembly line balancing problem under uncertainty ⋮ Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information ⋮ 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 ⋮ An integrated approach for a new flexible multi-product disassembly line balancing problem ⋮ Constraint programming for multi-line parallel partial disassembly line balancing problem with optional common stations ⋮ A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time ⋮ Models and two-phase bee algorithms for multi-objective U-shaped disassembly line balancing problem ⋮ Constraint programming approaches to disassembly line balancing problem with sequencing decisions ⋮ Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach ⋮ Type-E disassembly line balancing problem with multi-manned workstations
Cites Work
This page was built for publication: Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
