This paper investigates the performance of Differential Evolution (DE) in solving a Flexible Assembly Line (FAL) scheduling problem. Using a mathematical model developed in literature, the DE algorithm is implemented with the objectives of minimizing the sum of Earliness/Tardiness (E/T) penalties and maximizing the balance of the FAL. Experimental results have shown that DE is capable of solving the FAL scheduling problem effectively. Furthermore, a comparison with similar work in literature which employs Genetic Algorithm (GA) shows that DE produces a better solution. © 2011 Springer-Verlag.