Pages that link to "Item:Q1722962"
From MaRDI portal
The following pages link to A branch, bound, and remember algorithm for the simple disassembly line balancing problem (Q1722962):
Displayed 9 items.
- Type-E disassembly line balancing problem with multi-manned workstations (Q779771) (← links)
- An exact solution method for multi-manned disassembly line design with and/or precedence relations (Q821861) (← links)
- Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs (Q2027018) (← links)
- Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach (Q2049765) (← links)
- Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches (Q2108816) (← links)
- A dynamic programming approach to a multi-objective disassembly line balancing problem (Q2150762) (← links)
- A novel constraint programming and simulated annealing for disassembly line balancing problem with and/or precedence and sequence dependent setup times (Q2676318) (← links)
- An integrated approach for a new flexible multi-product disassembly line balancing problem (Q2676357) (← links)
- Models and two-phase bee algorithms for multi-objective U-shaped disassembly line balancing problem (Q6159499) (← links)
