Designing A Developed Genetic Algorithm To Solve The Job Shop Scheduling Problem (JSSP)

Scheduling is one of the most important issues in designing and managing production process. The problem is finding an optimum sheduling based on the work environment and the restrictions of production process.One of the important issues of scheduling is job shop scheduling problem (JSSP). The job shop scheduling problem (JSSP) is a NP-Hard issue. We used a developed genetic algorithm to solve job shop scheduling problem(JSSP). In the designed genetic algorithm it was tried to modify the cutting operator in order to increase the speed of convergence and also by using a new local searching algorithm we prevent the trapping of genetic algorithm in local optimizations. The results of implementing and evaluating of presented method on different subject indicated that the new method has desirable performance

کلیدواژه ها:

Job Shop Scheduling Problem (JSSP) ، Genetic Algorithm ، Selection Operator ، Cutting Operator ، Mutation operator