多任务调度问题存在于各种应用领域，如因特网服务领域，医疗领域等。经典的多任务调度模型中所有工件均可被其他等待工件打扰，且仅打扰一次。然而在生产实践过程中，有些紧急工件是不允许被其他工件打扰。在此启发下，对原有模型进行扩展，研究了在单机多任务环境下部分工件不可打扰的调度问题，模型目标包括最小化最大完工时间，最小化总完工时间，最小化最大延迟以及最小化加权提前期、拖延期和共同交货期之和。对于前三个目标给出了精确算法，对于最后一个目标给出了启发式算法。最后，对今后的研究提出了建议。

Multitasking scheduling can be found in various application domains, such as internet services, medical field and so on. In the original multitasking model, all jobs can be interrupted. However, some emergency jobs are not allowed to be interrupted by other jobs in the production process. Motivated by the reality, we extend the original model considering that some jobs are uninterrupted job. Our objective is to minimize the maximum completion time, the total completion time, the maximum lateness, and the weighted earliness, tardiness and common due date. We provide accurate algorithms respectively for the first three problems and an approximate algorithm for the last one. Finally, we summarize the paper and put forward suggestions for future research.