A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
From MaRDI portal
Publication:2815457
DOI10.1287/ijoc.1110.0462zbMath1462.90112OpenAlexW2112943632MaRDI 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
New formulations for the setup assembly line balancing and scheduling problem, 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?, Procedures for the bin packing problem with precedence constraints, A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem, The robust (minmax regret) assembly line worker assignment and balancing problem, Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints, Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment, 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, An exact dynamic programming algorithm for the precedence-constrained class sequencing problem, 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, An integrated approach for a new flexible multi-product disassembly line balancing problem, Analysis of the simple assembly line balancing problem complexity, R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines, 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, Mixed model line balancing with parallel stations, zoning constraints, and ergonomics, A branch, bound, and remember algorithm for the simple disassembly line balancing problem, SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Exact and heuristic methods for solving the robotic assembly line balancing problem, A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing 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, Advanced constraint propagation for the combined car sequencing and level scheduling 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, Weighted network search games with multiple hidden objects and multiple search teams, An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
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
