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

DOI10.1080/002075499191003MaRDI QIDQ4497013zbMATH OpenOpenAlexFDO

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

• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• Balancing assembly lines effectively -- a computational comparison
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• scientific article; zbMATH DE number 1175392
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure

Cited in

(27)

• \texttt{Absalom}: balancing assembly lines with assignment restrictions
• A two-process implicit enumeration algorithm for the simple assembly line balancing problem
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
• A branch, bound, and remember algorithm for the simple disassembly line balancing problem
• Balancing assembly lines effectively -- a computational comparison
• 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
• Assembly line balancing: what happened in the last fifteen years?
• Optimally solving the alternative subgraphs assembly line balancing problem
• 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
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
• Reconfiguration of assembly lines under the influence of high product variety in the automotive industry-a decision support system
• A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
• An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Procedures for the time and space constrained assembly line balancing problem
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• scientific article; zbMATH DE number 1175392 (Why is no real title available?)
• Incremental cell formation considering alternative machines
• Balancing large-scale machining lines with multi-spindle heads using decomposition
• Analysis of the simple assembly line balancing problem complexity
• The sequence-dependent assembly line balancing problem

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)