Comparison of two typical scheduling rules of line-seru conversion problem
Comparison of two typical scheduling rules of line-seru conversion problem
复制标题
DOI：
10.1504/ajmsa.2015.075337
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Yang Yu;Jiafu Tang;Yong Yin;I. Kaku
中科院分区：
文献类型：
--
作者：
Yang Yu;Jiafu Tang;Yong Yin;I. Kaku
SERU负载的调度规则不同，LINE-SERU转换的复杂度和改善的性能也不同。结合服务单元形成的复杂性和服务单元加载的复杂性，详细阐述了先到先服务(FCFS)和最短处理时间(SPT)两种典型调度规则下的线路-服务转换的组合复杂性，并且FCFS的状态复杂度远大于SPT。然而，通过数值实验，我们发现FCFS的LINE-SERU转换的性能改善并不比SPT好很多。因此，为了减少计算时间，SPT可以作为LINE-SERU转换问题的典型调度规则。
The complexity and the improved performance of line-seru conversion vary with the scheduling rules of seru loading. By combining the complexity of seru formation with the complexity of seru loading, this paper clarifies the combinatorial complexity of the line-seru conversion with two typical scheduling rules of first come first service (FCFS) and shortest processing time (SPT) in detail, and states complexity with FCFS is much more than that with SPT. However, by the numerical experiments we find that the performance improvement by line-seru conversion with FCFS is not much better than that with SPT. Therefore, it can be concluded that for decreasing the computational time SPT can be used as the typical scheduling rule in line-seru conversion problem.