Dequeue_task: When a task is no longer runnable, this function is called to keep the corresponding scheduling entity out of the red-black tree. It decrements the nr_running variable.
dequeue _ task：当某个任务退出可运行状态时调用该函数，它将从红黑树中去掉对应的调度实体，并从nr_running变量中减1。
The currently running task (now preempted) is returned to the red-black tree through a call to put_prev_task (via the scheduling class).
当前运行任务(现在被抢占的任务)通过对put _ prev_task调用(通过调度类)返回到红黑树。
It puts the scheduling entity (process) into the red-black tree and increments the nr_running variable.
它将调度实体(进程)放入红黑树中，并对nr_running变量加1。
This paper proposes a new algorithm for scheduling an Out-Tree task graph.
本文专门针对该类任务图，提出了一个新的调度算法。
At last we combine the spatial scheduling algorithm on Tree-Search with multilayer backtracking strategy, through that we can get a correctional dynamic spatial algorithm.
最后将基于树搜索的动态空间调度算法与多层回溯策略相结合，进一步得到一种修正的动态空间调度算法。
This paper proposes a dynamic spatial scheduling approach based on tree-search to solve the assembling spatial scheduling problem in the large-sized discrete companies.
针对大型离散企业产品组装空间调度问题，提出了一种基于树搜索的动态调度方法。
For the flexible scheduling problem of complex single product, a new hierarchical scheduling algorithm is presented based on improved processing operation tree model.
对复杂单产品柔性调度问题，本文在改进加工工艺树模型的基础上，提出一种新的分步式求解算法。
For the flexible scheduling problem of complex single product, a new hierarchical scheduling algorithm is presented based on improved processing operation tree model.
对复杂单产品柔性调度问题，本文在改进加工工艺树模型的基础上，提出一种新的分步式求解算法。
应用推荐