Skip to Main Content
This paper presents a modified genetic search algorithm for the non-regular job-shop scheduling problem with due date. The chromosome representation of the problem is based on the operation-based representation. In order to reduce the search space, the procedure for generating active schedules is constructed. For avoiding premature convergence in the conventional genetic algorithms (GA), the precedence operation crossover (POX) and approach of the generation alteration model are presented. The algorithm is tested on the instances for due date, the computation results validate the effectiveness of the proposed algorithm.