Pages that link to "Item:Q976518"
From MaRDI portal
The following pages link to A branch-and-bound algorithm to minimize the line length of a two-sided assembly line (Q976518):
Displaying 12 items.
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines (Q337254) (← links)
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (Q339701) (← links)
- Optimal operating strategy for a long-haul liner service route (Q421624) (← links)
- Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm (Q523563) (← links)
- Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study (Q1652149) (← links)
- Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm (Q1652273) (← links)
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem (Q1652325) (← links)
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm (Q1793174) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- Two-sided assembly line balancing problem with parallel performance capacity (Q2292341) (← links)
- A station-oriented enumerative algorithm for two-sided assembly line balancing (Q2462138) (← links)
- Constraint programming approach for multi-objective two-sided assembly line balancing problem with multi-operator stations (Q6094367) (← links)
