抄録
The job-shop scheduling problem (JSP) is one of the combinatorial optimizations and one of the most difficult order decision problems. Many approximate algorithms, which are heuristic methods or metaheuristics, are studied to solve JSP, because JSP is categorized into NP-hard problems. The application of the dispatching rules is known as a practical heuristic for JSP or many other scheduling problems. This study proposes an extended algorithm for JSP based on the genetic algorithm and a novel local search method using the dynamic dispatching rules. The extended algorithm searches for effective dispatching rules along with schedules according to the genetic algorithm. Also the schedules are partially modified by the rules in every generation. In order to verify the effectiveness of the proposed algorithm, this paper shows the result of numerical experiments.
