Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
From MaRDI portal
Publication:2668676
DOI10.1016/j.cor.2021.105235OpenAlexW3126955592MaRDI QIDQ2668676
Ibrahim Kucukkoc, Zixiang Li, Qiuhua Tang
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105235
Related Items (5)
An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Integrated real-time control of mixed-model assembly lines and their part feeding processes ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ Exact and heuristic methods for a workload allocation problem with chain precedence constraints
Cites Work
- Unnamed Item
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- On solving the assembly line worker assignment and balancing problem via beam search
- A dynamic programming based heuristic for the assembly line balancing problem
- Finding optimal line balances with OptPack
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- Designing paced assembly lines with fixed number of stations
- The application of a tabu search metaheuristic to the assembly line balancing problem
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Balancing assembly lines effectively -- a computational comparison
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Branch, bound and remember algorithm for two-sided 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
- 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
- A classification of assembly line balancing problems
- A versatile algorithm for assembly line balancing
- 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
- Beam-ACO for Simple Assembly Line Balancing
- Eureka: A Hybrid System for Assembly Line Balancing
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
This page was built for publication: Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
