Pages that link to "Item:Q4497013"
From MaRDI portal
The following pages link to A competitive branch-and-bound algorithm for the simple assembly line balancing problem (Q4497013):
Displaying 13 items.
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem (Q324311) (← links)
- The sequence-dependent assembly line balancing problem (Q991824) (← links)
- \texttt{Absalom}: balancing assembly lines with assignment restrictions (Q1044086) (← links)
- An enumerative heuristic and reduction methods for the assembly line balancing problem (Q1869496) (← links)
- U-shaped assembly line layouts and their impact on labor productivity: an experimental study (Q1877912) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Optimally solving the alternative subgraphs assembly line balancing problem (Q2267306) (← links)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
- Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system (Q3163133) (← links)
- Incremental cell formation considering alternative machines (Q4707456) (← links)
- Balancing large-scale machining lines with multi-spindle heads using decomposition (Q5385387) (← links)