基于排队论的“水蜘蛛”作业系统调度与仿真

The Scheduling and Simulation of“Water Spider”Operating System Based on the Queuing Theory

根据"水蜘蛛"作业的特点,将"水蜘蛛"作业系统的调度,看作是车辆路径问题。以最小化各工位的需求期望等待时间和各"水蜘蛛"的期望空闲时间之和T为目标函数,基于排队论建立"水蜘蛛"作业系统的数学模型。结合"水蜘蛛"作业的实际情况,分别对先到先服务策略、堆栈策略、一中心多分区策略和多中心多分区策略下的"水蜘蛛"作业系统进行详细描述和分析。基于蒙特卡洛仿真,对四种调度策略分别建立仿真模型,并输出四个模型的仿真结果。对四种策略下的任务平均完成时间、任务平均到达时间、任务平均等待完成时间和"水蜘蛛"的空闲率进行比较分析,得到四种调度策略各自的优缺点。

Based on the characteristics of ＂ water spider＂ work,the scheduling of ＂ water spider＂ operating system is viewed as a vehicle routing problem.In order to minimize objective function T that includes expected waiting time of each station and free time of the ＂ water spider＂,the mathematical model of ＂ water spider＂ operating system is built based on the queuing theory.Combined with the actual situation of ＂ water spider＂ operations,the ＂ water spider＂ operating system under first come first service strategy,stack strategy,one center multiple partition strategy and multiple center multiple partition strategy are respectively described and analyzed.Simulation models under the four scheduling policy are built based on Monte Carlo simulation,and the results of the four models are calculated.Through comparative analyses,the average completion time of task,the average arrival time of task,the average waiting time of task and ＂water spider＂ free rate under the four strategies are compared.The advantages and disadvantages of four scheduling strategies are shown.