Publications / 1999 Proceedings of the 16th ISARC, Madrid, Spain
In this paper, a general parallel flow shops problem with the objective of minimizing total earliness and tardiness has been addressed. In view of the intractable nature of the problem, a Genetic Algorithms (GAs) based approach is proposed to solve the problem. This algorithm has been tested on some randomly generated test problems. Computational results show the proposed approach is quite heartening.