Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization

DOI10.1007/978-3-540-77903-2_64zbMath1209.90168OpenAlexW1598011955MaRDI QIDQ5391957

Stephan Hartmann, Thomas A. Runkler

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_64

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Paint batching problem on \(M\)-to-1 conveyor systems ⋮ Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops

Cites Work

• Distributed optimisation of a logistic system and its suppliers using ant colonies
• Unnamed Item
• Unnamed Item

This page was built for publication: Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization