Simulations show that the provenance based equipment scheduling algorithm increases user satisfaction to 80% compared with the random scheduling algorithm.
实验结果表明：相对于随机调度算法，基于溯源信息的设备选择算法使得用户满意程度达80%。
The paper describes the feature of the automatic generation system for examination ID CARDS, the strategy of random scheduling and the main algorithm for creating examination ID CARDS.
论述了考场考证自动生成系统的特点，随机生成考证的策略及考证生成的主要算法。
This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.
讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。
Comparison with other tested heuristics verifies that the proposed random sampling method is significantly superior to other heuristics for scheduling resource-constrained multiple projects.
与其他多项目调度启发式算法的比较和统计检验，说明随机抽样算法显著优于这些常用的启发式算法。
Finally, one pair of cascade reservoir scheduling problem selected as an example, the practical solution is introduced by random optimal control theory and method.
最后，选取一对梯级水库的调度问题，以随机最优控制理论和方法进行了实际求解。
Since the tape libraries have very poor random access performance, it is critical to study random I/O scheduling strategies and algorithms in order to improve the performance of tape library.
由于磁带库随机存取的性能很差，需要研究有效的随机I/O调度策略和算法以改善其在线存取的效率。
And Modified Weighted Deficit Round Robin (MWDRR) scheduling scheme and Random Early Discard (RED) queuing mechanism are applied at scheduling end.
同时在调度端实现了改进的加权差额轮询调度策略(MWDRR)与队列管理的随机早期丢弃算法(RED)。
A multiuser scheduling method for MIMO system using random beamforming technique is proposed.
针对采用随机波束形成的MIMO系统，研究了一种多用户调度算法。
To optimize node selections for grid jobs under de-centralized scheduling frameworks, the algorithm of random multi-start hill climbing is proposed.
为优化无中心式调度框架下网格作业的节点选择，提出了随机多起点爬山算法。
The experiment results show that Adaptive Resource Scheduling is lower by 13.4% than Random Resource Scheduling in the access latency.
实验结果显示自适应资源调度算法在访问延迟上比随机作业调度算法低了13.4%。
This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.
针对机器速度和准备时间不同，探讨了带机器准备时间的两台同类机半在线排序问题，以达到优化工作效率的目的。
This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.
针对机器速度和准备时间不同，探讨了带机器准备时间的两台同类机半在线排序问题，以达到优化工作效率的目的。
应用推荐