Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Authors:
R. F. Tavares Neto;M. Godinho Filho
Affiliations:
Industrial Engineering Department, Federal University of Sao Carlos, Rod. Washington Luis, Km 235, Sao Carlos, Sao Paulo 13565-905, Brazil;Industrial Engineering Department, Federal University of Sao Carlos, Rod. Washington Luis, Km 235, Sao Carlos, Sao Paulo 13565-905, Brazil
Venue:
Engineering Applications of Artificial Intelligence
Year:
2013

Citing 21
Cited 1

MAX-MIN Ant system

Future Generation Computer Systems
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Ant Colony Optimization for the Total Weighted Tardiness Problem

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time

Computers and Industrial Engineering
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research
Ant colony optimization combined with taboo search for the job shop scheduling problem

Computers and Operations Research
Ant colony optimization for multi-objective flow shop scheduling problem

Computers and Industrial Engineering
A hybrid algorithm for the single-machine total tardiness problem

Computers and Operations Research
ACO-Based Scheduling of Parallel Batch Processing Machines with Incompatible Job Families to Minimize Total Weighted Tardiness

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan

Computers and Operations Research
Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm

Expert Systems with Applications: An International Journal
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Computers and Operations Research
An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed

Computers and Operations Research
Makespan minimization on single batch-processing machine via ant colony optimization

Computers and Operations Research
Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Software Survey: Distributed job scheduling based on Swarm Intelligence: A survey

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant Colony Optimization is a swarm intelligence approach that has proved to be useful in solving several classes of discrete and continuous optimization problems. One set, called scheduling problems, is extremely important both to academics and to practitioners. This paper describes how the current literature uses the ACO approach to solve scheduling problems. An analysis of the literature allows one to conclude that ACO is a hugely viable approach to solve scheduling problems. On the basis of the literature review, we were not only able to derive certain guidelines for the implementation of ACO algorithms but also to determine possible directions for future research.