点击次数：

论文类型：期刊论文

发表时间：2022-06-28

发表刊物：系统工程理论与实践

期号：12

页面范围：3074-3082

ISSN号：1000-6788

摘要：In this paper, we are mainly concerned with the on-line job scheduling problem in the orderoriented enterprise. By analyzing time intervals on devices that a new task can be inserted in, an algorithm based on shortest time interval for on-line job scheduling is proposed. Its main idea is to model the scheduling problem as an acyclic digraph in graph theory, and then the scheduling can be realized by adding vertices and edges in a digraph. Simulation results show that the algorithm performs well with guaranteeing the deadline of each other, and changes little the relative execution sequences of tasks on each device. There are fewer time intervals on devices when orders come frequently, and the utilization rate of devices is very high, reaching nearly 94% in the simulation results. In addition, the algorithm runs fast. Thus, it is suitable for solving large-scale on-line job scheduling problem. © 2015, Systems Engineering Society of China. All right reserved.

备注：新增回溯数据