Scheduling problems are NP – Hard combinatorial optimization problems, since many algorithms have been developed which offers new promising insights for solving resource allocation problems. Considering the problems faced in automobile repair shops, who sets the customer due dates of the car based on processing time, jobs already waiting for processing and mechanic available time. Also the workload of the mechanic should be balanced and minimize the make-span of the work. So this paper is concerned with determination of optimal allocation of repair jobs to the mechanic using Artificial Neural Network and hence to determine the minimum Total cost and make span of repair.