Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop scheduling
Author:
- 1 June 2005
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (6) , 1565-1591
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- Ant colony optimization for resource-constrained project schedulingIEEE Transactions on Evolutionary Computation, 2002
- Metaheuristics for Group Shop SchedulingLecture Notes in Computer Science, 2002
- A hybrid genetic algorithm for the open shop scheduling problemEuropean Journal of Operational Research, 2000
- – Ant SystemFuture Generation Computer Systems, 2000
- A branch & bound algorithm for the open-shop problemDiscrete Applied Mathematics, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 1993
- Filtered beam search in scheduling†International Journal of Production Research, 1988
- Optimization by Simulated AnnealingScience, 1983