The assembly line balancing problem (ALBP) is knownas one of difficult combinatorial optimization problems.It has received a great attention over the year. Ingeneral, it consists of assigning tasks to an orderedsequence of stations such that the precedence relationsamong the tasks are satisfied and some performancemeasure is optimized.This paper presents the simple assembly line balancingproblem type I (SALBP-1; the number of workstationsis minimized for a given cycle time) using Max-MinAnt System (MMAS) method to find optimal or nearoptimal solutions that compared with the previouspublished research work. The performance of thismethod is measured by solving a large-scale ofbenchmark problems that available in the literature.From the results, the computational experiments showsthat the MMAS is quite effective and competitive withthe other metaheuristic method for this problem.