선행관계를 가진 다중프로세서 작업들의 Makespan 최소화를 위한 변형타부검색

• 영문명: Applying tabu search to multiprocessor task scheduling problem with precedence relations
• 발행기관: 한국산업경영시스템학회
• 저자명: 이동주(Dong-Ju Lee)
• 간행물 정보: 『산업경영시스템학회지』제27권 제4호, 42~48쪽, 전체 7쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2004.12.01

영문 초록

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors simultaneously Meta-heuristic generally finds a good solution If It starts from a good solution In this paper, a tabu search is presented to find a schedule of minimal time to complete all tasks A modified tabu search is also presented which uses a new Initial solution based on the best solution during the previous run as the new starting solution for the next Iteration Numerical results show that a tabu search and a modified tabu search yield a better performance than the previous studies

목차

Abstract

1. 서론

2. 중간행렬과 초기해

3. 타부검색(Tabu Search, TS)에 의한 해의 개선

4. 결과

5. 결론

참고문헌