Beam-ACO for Simple Assembly Line Balancing
From MaRDI portal
Publication:2901039
DOI10.1287/ijoc.1080.0271zbMath1243.90058OpenAlexW2151768155MaRDI QIDQ2901039
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0271
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
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? ⋮ 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 ⋮ Reduction approaches for a generalized line balancing problem ⋮ On solving the assembly line worker assignment and balancing problem via beam search ⋮ Beam-ACO for the travelling salesman problem with time windows ⋮ A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem ⋮ Beam-ACO ⋮ An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
