A possible solution methodology for 2-Stage Assembly Flow-shop Scheduling Problem is studied in this research. Minimization of job completion time difference between the 1st job and the last job for a group of jobs is focused while minimization of completion time are focused in general. The developed method is designed as a heuristic with pairwise exchange since 2AFSs are typical combinatorial optimization problems. The performance of the suggested heuristic is proved by comparison study with the optimum solution by enumeration for small sized problem and with the population randomly generated cases by RAND of Excel and Microsoft Visual Basic.