论文部分内容阅读
根据“水蜘蛛”作业的特点,将“水蜘蛛”作业系统的调度,看作是车辆路径问题。以最小化各工位的需求期望等待时间和各“水蜘蛛”的期望空闲时间之和T为目标函数,基于排队论建立“水蜘蛛”作业系统的数学模型。结合“水蜘蛛”作业的实际情况,分别对先到先服务策略、堆栈策略、一中心多分区策略和多中心多分区策略下的“水蜘蛛”作业系统进行详细描述和分析。基于蒙特卡洛仿真,对四种调度策略分别建立仿真模型,并输出四个模型的仿真结果。对四种策略下的任务平均完成时间、任务平均到达时间、任务平均等待完成时间和“水蜘蛛”的空闲率进行比较分析,得到四种调度策略各自的优缺点。
According to “water spider ” operating characteristics, the “water spider ” operating system scheduling, as a vehicle routing problem. Based on the queuing theory, a mathematic model of “Water Spider” operating system is established with the objective of minimizing the expected waiting time of demand and the expected free time of each water spider. According to the actual situation of “water spider ” operation, this paper describes and analyzes the “spider ” operating system under the first-come first-served strategy, the heap strategy, the one-center multi-zone strategy and the multi-center multi-zone strategy. Based on Monte Carlo simulation, the simulation models are respectively established for the four scheduling strategies and the simulation results of the four models are output. The average completion time, the average arrival time of the task, the average waiting time for completion of the task and the vacancy rate of the “water spider” under the four strategies are compared and the advantages and disadvantages of the four kinds of scheduling strategies are obtained.