The Hybrid Approach of LCO and SA to Solve Job-shop Scheduling Problem
Yasumasa Tamura, Ikuo Suzuki, Masahito Yamamoto, Masashi Furukawa
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. Summarizing this study, the proposed method is efficient in the early or middle search of the optimization.