THE HYBRID APPROACH OF LCO AND SA TO SOLVE JOB-SHOP SCHEDULING PROBLEM

摘要

A Job-shop Scheduling Problem (JSP) is one of the combinatorial optimization problems. JSP appears as a basic scheduling problem in many situations of a manufacturing system and many methods for JSP have been invented. This study examines two effective methods, SA and LCO, for JSP and propose a hybrid method based on them. As a result of the experiments, the proposed method can find a good solution with short computational time. And the proposed method can hold the variance of the solutions less than the fundamental methods. Summarizing this study, the proposed method can find a good solution efficiently and stably.