Scheduling is an important problem for many computer application areas. Job-Shop scheduling is a typical kind of difficult problems among them. It usually comprises several parallel goals, methods and resources available to realize the goals. Based on a practical Job-Shop problem model, the paper presents a chromosome representation method for genetic algorithm based on the scheduling problem. To fully use the knowledge of the problem, the authors also propose resource-space oriented and plan-space oriented genetic operators. The experiment result demonstrates that the performance of the method is satisfactory, and it also shows that the pre-mature problem can be solved by dynamically changing the probability of genetic operators or by scaling the fitness values of chromosomes.