Beam-ACO

swMATH11745MaRDI QIDQ23684

No author found.

Described by source

• Beam-ACO for Simple Assembly Line Balancing

Related Items (21)

Compiling finite linear CSP into SAT ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ Hybrid Metaheuristics: An Introduction ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ A beam search approach for the optimization version of the car sequencing problem ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A modified ant colony system for solving the travelling salesman problem with time windows ⋮ A new particle swarm optimization for the open shop scheduling problem ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ The museum visitor routing problem ⋮ Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling ⋮ Beam-ACO for the travelling salesman problem with time windows ⋮ A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design ⋮ Ant colony optimization theory: a survey

This page was built for software: Beam-ACO