This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
应用推荐