A competitive branch-and-bound algorithm for the simple assembly line balancing problem
From MaRDI portal
Publication:4497013
DOI10.1080/002075499191003zbMath0949.90522OpenAlexW2165243802MaRDI QIDQ4497013
Publication date: 21 August 2000
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075499191003
Related Items (13)
U-shaped assembly line layouts and their impact on labor productivity: an experimental study ⋮ Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system ⋮ Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem ⋮ Balancing large-scale machining lines with multi-spindle heads using decomposition ⋮ Optimally solving the alternative subgraphs assembly line balancing problem ⋮ The sequence-dependent assembly line balancing problem ⋮ Incremental cell formation considering alternative machines ⋮ A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem ⋮ \texttt{Absalom}: balancing assembly lines with assignment restrictions ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ An enumerative heuristic and reduction methods for the assembly line balancing problem
This page was built for publication: A competitive branch-and-bound algorithm for the simple assembly line balancing problem
