抄録
In a production process design, it is required to define working time and scheduling by the number of a machine and performance but single solution is calculated when existing method is applied. It is necessary to propose some schedules and to assist a designer. In this study, immune algorithm is used and improved to solve jobshop scheduling problem known as a difficult problem in combination optimization problems and genetic algorithm is compared with immune algorithm for this problem. Through some examples, we showed that some optimal solutions and quasi-optimal solution could be found
