Beam-ACO for simple assembly line balancing

DOI10.1287/IJOC.1080.0271MaRDI QIDQ2901039zbMATH OpenOpenAlexFDO

Authors Christian Blum

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

zbMATH Keywords

artificial intelligencecomputer science

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

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

(15)

• Reduction approaches for a generalized line balancing problem
• Assembly line balancing: what happened in the last fifteen years?
• Beam-ACO for the travelling salesman problem with time windows
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• Beam-ACO
• Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• Iterative beam search for simple assembly line balancing with a fixed number of work stations
• Stochastic assembly line balancing using beam search
• Analysis of the simple assembly line balancing problem complexity
• Flight test scheduling: a generic model, lower bounds, and iterated local search
• An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
• Contemporary approaches in matheuristics an updated survey
• On solving the assembly line worker assignment and balancing problem via beam search

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)