Trends in Applied Sciences Research1819-35792151-7908Science International10.3923/tasr.2007.404.411SaadOmar M.5200725This study presents a solution algorithm for the problem of minimizing the makespan on unrelated parallel machines with machine eligibility restrictions under fuzziness. It is considered that the processing times are those fuzzy parameters and the maximum completion time is required to be minimized. A simulation experiment is conducted to examine how well the fuzzy approach performs in obtaining optimal solutions with respect to the solution time. Some numerical examples are involved to clarify the developed theory and the solution algorithm.]]>Abass, S.A.,20002000Allet, S.,2003147312333Celano, G., A. Costa and S. Fichera,200311655669Centeno, G. and R. Armacost,199733273276Centeno, G.,19981998Chanas, S. and A. Kasperski,2003147281296Chanas, S. and A. Kasperski,2004142359371Cheng, T. and C. Sin,199047271292Davis, E. and J.M. Jaffe,198128721736De, P. and T. Morton,198011586602Dubois, D. and A. Prade,1980Garey, M. and D. Johnson, 197911th Edn.,Hariri, A.M.A. and C.N. Potts,199118313321Horowitz, E. and S. Sahni,197623317327Ibarra, O. and C. Kim,197724280289Ishii, H., M. Tada and T. Masuda,199246339347Itoh, T. and H. Ishii,19996639647Martello, S., F. Soumis and P. Toth,199775169188Pinedo, M.,1995Potts, C.N.,198510155164Saad, O.M., W.H. Sharif and S.A. Abass,200215211222Sahni, S.,197623116127Salem, A. and R. Armacost,200215193210Velde, S.V.D.,19935192205Bellman, R.E. and L.A. Zadeh,197017B141B164