Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function

This paper presents a genetic algorithm with a penalty function for the job shop scheduling problem. In the context of proposed algorithm, a clonal selection based hyper mutation and a life span extended strategy is designed. During the search process, an adaptive penalty function is designed so that the algorithm can search in both feasible and infeasible regions of the solution space. Simulated experiments were conducted on 23 benchmark instances taken from the OR-library. The results show the effectiveness of the proposed algorithm.