A hybrid algorithm for multi-objective job shop scheduling problem

In this study, we proposed a hybrid algorithm for solving the job shop scheduling problem with two objectives, i.e., to minimize the maximal completion time, the total flow time. The tabu search (TS) algorithm was used to conduct local search. Several initial approaches are presented to produce initial solution with high level of quality. The neighborhood structure based on critical block was introduced to reduce the searching space size. Experimental results based on well-known benchmarks show the efficiency and effectiveness of the proposed algorithm.