학술저널
단일 통신 지연시간을 갖는 1-MSP
1 -MSP with Unit Time Commumcation delay
- 호서대학교 공업기술연구소
- 공업기술연구 논문집
- 제23권 제1호
-
2004.0655 - 65 (11 pages)
- 0
커버이미지 없음
A parallel machine scheduling problem in department of industrial and VLSI is on the effective method for all works to be finished m a short time considering precedent constrains between works. The problem of finding a schedule for m equal length tasks constrained by an arbitrary precedence relation such that the total time needed to execute all tasks on n identical machines is minimized. But most scheduling problems are intractable, that is, they belong to the class NP-hard problem. This paper is to classify Posets which is the basis of general scheduling work.
1.서 론
I I . 부분순서 집합의 기본 개념
in. 스케줄링의 기본 개념
IV. 1 -머신으로 충분한 p o s e t
V . 결 론
(0)
(0)