Beam-ACO for simple assembly line balancing
From MaRDI portal
Publication:2901039
Recommendations
- Iterative beam search for simple assembly line balancing with a fixed number of work stations
- On solving the assembly line worker assignment and balancing problem via beam search
- Stochastic assembly line balancing using beam search
- Simple and U-type assembly line balancing by using an ant colony based algorithm
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
Cited in
(12)- Beam-ACO for the travelling salesman problem with time windows
- Assembly line balancing: what happened in the last fifteen years?
- Iterative beam search for simple assembly line balancing with a fixed number of work stations
- Beam-ACO
- Stochastic assembly line balancing using beam search
- 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
- On solving the assembly line worker assignment and balancing problem via beam search
- 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
- Reduction approaches for a generalized line balancing problem
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
This page was built for publication: Beam-ACO for simple assembly line balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901039)