Q-learning was applied to resolution of the adaptive dispatching rule selection problem under dynamic single-machinescheduling environment.
提出了一种利用Q-学习解决动态单机调度环境下的自适应调度规则选择的方法。
2
Through the analysis of the problem, it is proved that the problem is equivalent to a single-machinescheduling for minimizing an analogous function of delay.
基于对问题的分析,证明了这一问题等价于单机调度中极小化类似的延迟量函数。
3
Minimize the total weighted completion time singlemachinescheduling problems.