A competitive branch-and-bound algorithm for the simple assembly line balancing problem

DOI10.1080/002075499191003zbMATH Open0949.90522OpenAlexW2165243802MaRDI QIDQ4497013FDOQ4497013

Authors Arno Sprecher

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

Cited In (24)

Incremental cell formation considering alternative machines
The sequence-dependent assembly line balancing problem
\texttt{Absalom}: balancing assembly lines with assignment restrictions
Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
A two-process implicit enumeration algorithm for the simple assembly line balancing problem
Assembly line balancing: what happened in the last fifteen years?
Optimally solving the alternative subgraphs assembly line balancing problem
A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
Procedures for the time and space constrained assembly line balancing problem
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
Analysis of the simple assembly line balancing problem complexity
A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
A branch, bound, and remember algorithm for the simple assembly line balancing problem
Balancing assembly lines effectively -- a computational comparison
Balancing large-scale machining lines with multi-spindle heads using decomposition
A branch, bound, and remember algorithm for the simple disassembly line balancing problem
An enumerative heuristic and reduction methods for the assembly line balancing problem
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
An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

This page was built for publication: A competitive branch-and-bound algorithm for the simple assembly line balancing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497013)