An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

DOI10.1016/j.ejor.2013.11.033zbMath1317.90258OpenAlexW1991625760MaRDI QIDQ2356246

David R. Morrison, Edward C. Sewell, Jacobson, Sheldon H.

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.033

zbMATH Keywords

combinatorial optimizationbranch and boundassembly line balancing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements ⋮ The stability radius of an optimal line balance with maximum efficiency for a simple assembly line ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ Procedures for the bin packing problem with precedence constraints ⋮ Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints ⋮ Branch, bound and remember algorithm for two-sided assembly line balancing problem ⋮ Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ Bin Packing Problem with Time Lags ⋮ Results for the close-enough traveling salesman problem with a branch-and-bound algorithm ⋮ Exact and heuristic methods for a workload allocation problem with chain precedence constraints ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ Exact and heuristic methods for solving the robotic assembly line balancing problem ⋮ Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams

Uses Software

• SALBPGen

Cites Work

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• 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
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• An linear programming based lower bound for the simple assembly line balancing problem
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Eureka: A Hybrid System for Assembly Line Balancing
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• Designing a mixed-model, open-station assembly line using mixed-integer programming