동일하지 않는 병렬기계 시스템에서 지연작업수를 최소화하는 Tabu Search 방법

Tabu Search methods to minimize the number of tardy jobs in nonidentical parallel machine scheduling problem

This paper presents a Tabu Search method to minimize a number of tardy jobs in the nonidentical parallel machine scheduling. The Tabu Search method employs a restricted neighborhood for the reduction of computation time. In this paper, we use two different types of method for a single machine scheduling. One is Moore's algorithm and the other is insertion method. We discuss computational experiments on more than 1000 test problems.