An application of immune algorithms for job-shop scheduling problems

Job-shop scheduling problems (JSSPs) are important problems that decide production scheduling. However these problems are not easy to solve and many studies have been done. Furthermore, in real situation, while doing jobs according to decided schedule, re-scheduling occurs because of new jobs and it is required to decide the schedule considering ability and skills of works. In this study, in the stage of the deciding the JSSPs, we will discuss the method to offer the designer several candidates of the JSP and then designers can select the final schedule considering the difficult properties to formulate the problems. Through some numerical examples, we will confirm the effectiveness of the proposed method.