Pages that link to "Item:Q1652149"
From MaRDI portal
The following pages link to Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study (Q1652149):
Displaying 11 items.
- Multi-neighborhood based path relinking for two-sided assembly line balancing problem (Q306088) (← links)
- Variable neighborhood search for the second type of two-sided assembly line balancing problem (Q342398) (← links)
- Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm (Q523563) (← links)
- A two-process implicit enumeration algorithm for the simple assembly line balancing problem (Q1091255) (← links)
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem (Q1652325) (← links)
- Bees algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem (Q1758046) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
- A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis (Q2289927) (← links)
- Balancing of two-sided disassembly lines: problem definition, MILP model and genetic algorithm approach (Q2664414) (← links)
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
