Subscribe Now Subscribe Today
Science Alert
FOLLOW US:     Facebook     Twitter
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 21 | Page No.: 3938-3944
DOI: 10.3923/jas.2008.3938.3944
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
An Ant Colony Algorithm for the Flowshop Scheduling Problem
S.J. Sadjadi, J.L. Bouquard and M. Ziaee

In this study, we considered the flowshop scheduling problem with the objectives of the makespan (F//Cmax) and the total flowtime (F//Σfi) separately. The permutation case of the problem was first solved by an Ant Colony Optimization (ACO) algorithm. The permutation solutions of this ACO algorithm were then improved by a non-permutation local search. In order to evaluate the performance of the proposed metaheuristic, computational experiments were performed using the well-known benchmark problems. A comparison with Rajendran solutions and the best metaheuristic solutions known for Taillard benchmark problems was carried out, show that the proposed ACO algorithm was clearly superior to the above metaheuristics.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

S.J. Sadjadi, J.L. Bouquard and M. Ziaee, 2008. An Ant Colony Algorithm for the Flowshop Scheduling Problem. Journal of Applied Sciences, 8: 3938-3944.

DOI: 10.3923/jas.2008.3938.3944








Curve Bottom