Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2008.3938.3944SadjadiS.J. BouquardJ.L. ZiaeeM. 122008821In 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.]]>Allahverdi, A.,2003147373396Cheng, T.C.E., J.N.D. Gupta and W. Guoqing,20009262282Dorigo, M. and T. Stutzle,2004Pages: 305Pages: 305Jain, A.S. and S. Meeran,20022918731901Koulamas, C., 19981056671Liao, C.J., L.M. Liao and C.T. Tseng,20064442974309Nawaz, M., E.E. Enscore Jr. and I. Ham,1983119195Osman, I. and C. Potts,198917551557Pugazhendhi, S., S. Thiagarajan, C. Rajendran and N. Anantharaman,200244133157Rajendran, R.C. and Z. Hans,2004155426438Ruiz, R. and M. Concepcion,2005165479494Taillard, E.,199347278285Vallada, E. and R. Ruben,20082008Varadharajan, T.K. and R. Chandrasekharan,2005167772795Woo, H.S. and D.S. Yim,199825175182