Genetic Algorithm for the Job-Shop Scheduling with Skilled Operators
In this paper, we tackle the job shop scheduling problem (JSP) with skilled operators (JSPSO). This is an extension of the classic JSP in which the processing of a task in a machine has to be assisted by one operator skilled for the task. The JSPSO is a challenging problem because of its high complexity and because it models many real-life situations in production environments. To solve the JSPSO, we propose a genetic algorithm that incorporates a new coding schema as well as genetic operators tailored to dealing with skilled operators. This algorithm is analyzed and evaluated over a benchmark set designed from conventional JSP instances. The results of the experimental study show that the proposed algorithm performs well and at the same time they allowed us to gain insight into the problem characteristics and to draw ideas for further improvements.
KeywordsGenetic Algorithm Skilled Operator Feasible Schedule Operator Sequence Solution Graph
Unable to display preview. Download preview PDF.