抄録
In this paper, the job shop scheduling algorithm using tabu search (TS) is focused on. As the parameters and conditions of TS algorithm are known to influence the performance of solution improvement, but only a few previous researches have been made to clarify such facts, in this paper, the initial solution is focused on and the importance of the initial solution on job shop scheduling that uses TS is clarified. Also, in order to get a good initial solution, an algorithm of grouping operations of jobs, whose aim is to decrease changeover time is used.
