先来先服务，抢占式进程。

模拟进程调度，能够处理以下的情形：

　　　⑴ 能够选择不同的调度算法（要求中给出的调度算法）；

　　　⑵ 能够输入进程的基本信息，如进程名、到达时间和运行时间等；

　　　⑶ 根据选择的调度算法显示进程调度队列；

⑷ 根据选择的调度算法计算平均周转时间和平均带权周转时间。-First-come, first-served preemptive process. Analog process scheduling, able to handle the following situations: ⑴ be able to select different scheduling algorithms (given in the request scheduling algorithm)　(2) be able to enter the basic information of the process, such as the process name, arrival time and run time　⑶ choice The scheduling algorithm process scheduling queue　turnaround time (4) according to the selected scheduling algorithms to calculate the average turnaround time and average with the right.