Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2007.208.213SenthiilP.V.SelladuraiV.RajeshR.2200772This study introduces a new approach for decentralized scheduling in a parallel machine environment based on the ant colonies optimization algorithm. The algorithm extends the use of the traveling salesman problem for scheduling in one single machine, to a multiple machine problem. The results are presented using simple and illustrative examples and show that the algorithm is able to optimize the different scheduling problems. Using the same parameters, the completion time of the tasks is minimized and the processing time of the parallel machines is balanced.]]>Vincent, C.A. and S.F. Smith,2001Gilmore, P.C. and R.E. Gomory,1964Graham, R.L.,1969Dorigo, M., V. Maniezzo and A. Colorni,1996Maria, G.L. and M. Dorigo,1996McKay, K., M. Pinedo and S. Webster,2001Pinedo, M.,2002Pinedo, P.X.C.,2002Robertino, J. and H. Chenk,2004Silva, C.A., T. Runkler, J.M. Sousa and R. Palm,2002Wellman, M.P., W.E. Walsh, P. Wurman and J.K. Mackie-Mason,2001Tofin, U.,2003