A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem

DOI10.1287/ijoc.1110.0462zbMath1462.90112MaRDI QIDQ2815457

Jacobson, Sheldon H., Edward C. Sewell

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0462

zbMATH Keywords

heuristics; production; combinatorial optimization; branch and bound; programming

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

New formulations for the setup assembly line balancing and scheduling problem, Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset, Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements

Cites Work

• A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• Ant algorithms for a time and space constrained assembly line balancing problem
• A dynamic programming based heuristic for the assembly line balancing problem
• Finding optimal line balances with OptPack
• Balancing assembly lines effectively -- a computational comparison
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
• A classification of assembly line balancing problems
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• A survey on problems and methods in generalized assembly line balancing
• Balancing assembly lines with tabu search
• Beam-ACO for Simple Assembly Line Balancing
• An Analysis of Pediatric Vaccine Formulary Selection Problems
• Metaheuristics based on Bin Packing for the line balancing problem
• Generalized best-first search strategies and the optimality of A*
• Eureka: A Hybrid System for Assembly Line Balancing
• Branch-and-Bound Strategies for Dynamic Programming
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• A competitive branch-and-bound algorithm for the simple assembly line balancing problem