논문 상세보기

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

Applying tabu search to multiprocessor task scheduling problem with precedence relations

  • 언어KOR
  • URLhttps://db.koreascholar.com/Article/Detail/22238
구독 기관 인증 시 무료 이용이 가능합니다. 4,000원
한국산업경영시스템학회지 (Journal of Society of Korea Industrial and Systems Engineering)
한국산업경영시스템학회 (Society of Korea Industrial and Systems Engineering)
초록

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

저자
  • 이동주 | Dong-Ju Lee