Scheduling Problem for Allocating Worker with Class-Type Skill in JSP by Hybrid Genetic Algorithm

Scheduling in manufacturing systems is one of the most important and complex combinatorial optimization problems, where it can have a major impact on the productivity of a production process. Moreover, most of manufacturing scheduling models fall into the class of NP-hard combinatorial problems. In a real world manufacturing system, a plurality of worker who operates the machine exists, depending on the skill level by the workers for each machine and working time is different even if same work on the same machine in job-shop scheduling problem (JSP). Therefore, it is taking to account for differences in working time by the worker is scheduling problem with worker allocation. In this paper, in order to approach the more realistic model by dividing into several class workers and to determine the skill level for each machine for each class worker, we propose a new model that introduced the concept of class-type skill and demonstrate the effectiveness of the computational result by Hybrid Genetic Algorithm.