针对人工绘制露天矿设备调度图表存在的费时费力、效率低、缺乏纠错手段等问题,以规范化、模块化、智能化、可视化为目标,确定了系统功能和新的故障处理业务流程,设计了数据库、图表绘制、故障指标统计与可视化展示等技术方案,并以Visua...针对人工绘制露天矿设备调度图表存在的费时费力、效率低、缺乏纠错手段等问题,以规范化、模块化、智能化、可视化为目标,确定了系统功能和新的故障处理业务流程,设计了数据库、图表绘制、故障指标统计与可视化展示等技术方案,并以Visual C#2013为集成开发平台、以SQL Server 2008为后台数据库,开发了扩展性和实用性较强的露天矿设备调度图表绘制与管理系统,实现了调度图表的智能可视化,提高了统计信息的实时性和准确性。经抚顺西露天矿数据检验,取得了较为满意的效果。展开更多
Optimized task scheduling is one of the most important challenges to achieve high performance in multiprocessor environments such as parallel and distributed systems. Most introduced task-scheduling algorithms are bas...Optimized task scheduling is one of the most important challenges to achieve high performance in multiprocessor environments such as parallel and distributed systems. Most introduced task-scheduling algorithms are based on the so-called list scheduling technique. The basic idea behind list scheduling is to prepare a sequence of nodes in the form of a list for scheduling by assigning them some priority measurements, and then repeatedly removing the node with the highest priority from the list and allocating it to the processor providing the earliest start time （EST）. Therefore, it can be inferred that the makespans obtained are dominated by two major factors： （1） which order of tasks should be selected （sequence subproblem）; （2） how the selected order should be assigned to the processors （assignment subproblem）. A number of good approaches for overcoming the task sequence dilemma have been proposed in the literature, while the task assignment problem has not been studied much. The results of this study prove that assigning tasks to the processors using the traditional EST method is not optimum; in addition, a novel approach based on the ant colony optimization algorithm is introduced, which can find far better solutions.展开更多
文摘针对人工绘制露天矿设备调度图表存在的费时费力、效率低、缺乏纠错手段等问题,以规范化、模块化、智能化、可视化为目标,确定了系统功能和新的故障处理业务流程,设计了数据库、图表绘制、故障指标统计与可视化展示等技术方案,并以Visual C#2013为集成开发平台、以SQL Server 2008为后台数据库,开发了扩展性和实用性较强的露天矿设备调度图表绘制与管理系统,实现了调度图表的智能可视化,提高了统计信息的实时性和准确性。经抚顺西露天矿数据检验,取得了较为满意的效果。
基金Project supported by Sama Technical and Vocational Training College,Islamic Azad University,Shoushtar Branch,Shoushtar,Iran
文摘Optimized task scheduling is one of the most important challenges to achieve high performance in multiprocessor environments such as parallel and distributed systems. Most introduced task-scheduling algorithms are based on the so-called list scheduling technique. The basic idea behind list scheduling is to prepare a sequence of nodes in the form of a list for scheduling by assigning them some priority measurements, and then repeatedly removing the node with the highest priority from the list and allocating it to the processor providing the earliest start time （EST）. Therefore, it can be inferred that the makespans obtained are dominated by two major factors： （1） which order of tasks should be selected （sequence subproblem）; （2） how the selected order should be assigned to the processors （assignment subproblem）. A number of good approaches for overcoming the task sequence dilemma have been proposed in the literature, while the task assignment problem has not been studied much. The results of this study prove that assigning tasks to the processors using the traditional EST method is not optimum; in addition, a novel approach based on the ant colony optimization algorithm is introduced, which can find far better solutions.
