我们为了弥补不能一心多用，而有了极快的连续处理单项任务的能力。
We compensate for our inability to multitask with a remarkable ability to single-task in rapid succession.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
如图2所示，加入一个菜单项后就能完成该项任务。
Add a menu item as shown in figure 2 to accomplish this task.
应用推荐