Abstract:

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.

Key words: single machine, multitasking scheduling, uninterrupted, common due date