This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors at a time. The problem is to find a schedule of minimal time to complete all tasks. In this paper, a tabu search is presented. Numerical results show that tabu search yields a better performance than the previous studies.

Abstract
 1. 서론
 2. 중간행렬과 초기해
 3. 타부검색(Tabu Search, TS)에 의한 해의 개선
  3.1 이동(move)과 이웃해(Neighborhood)
  3.2 타부목록(Tabu List)
  3.3 열망함수(The aspiration function)와 타부검색 앨고리듬
 4. 결과
 5. 결론
 참고문헌

• 이동주(공주대학교 산업시스템공학과)