本程序需要用到数据结构中队列的概念完成。用指针指出下一个进程的PCB首地址，最后一个进程中指针为“0”。该调度算法是从后备队列中选择一个或若干个估计运行时间最短的作业，将其调入内存运行。当要求运行时间不为0时，将PCB加入队列（按优先数大小插入，且置队首标志）；若要求运行时间为0，则把它的状态修改为“结束”（），并退出队列。-the procedures need to resort to queue data structure to complete the concept. Using indicators under a process that the PCB first address, the final process of a target to "0." The scheduling algorithm from the reserve queue is a choice among a number of estimates or the shortest run the operation, the redeployment of its memory operation. When asked for running time 0:00 a.m., the PCB will join the queue (by inserting small number of priority, but the first signs of home team); if the running time to 0, ruled the state to "end" (), and to withdraw from the queue.