Scheduling in a job shop is very important in both the fields of production-management and combinatorial optimization. This paper deals with solving the job shop scheduling problem using genetic algorithm (GA). The objective of this study is to optimize the perforrnance measures. The performance of GA is compared with that of heuristics shortest processing time and most work remaining. Computational results show the effectiveness of the proposed GA.