查询词典 scheduling problem

Job-shop scheduling is a typical combinatorial optimization problem, and large scale scheduling optimization is one of such difficult optimization problems.

作业车间调度是一种典型的组合优化问题，大规模的调度优化是该类问题的难点。

The result can be applied to flow shop scheduling and job shop scheduling problem directly,and has practical applied value.

研究结果可直接应用于企业流水车间调度和作业车间调度，具有一定的实际应用价值。

Hybrid Flow Shop scheduling problem is a kind of complicated scheduling problems which involve task, resource and time.

混合流水线(Hybrid Flow Shop，简称HFS)调度问题是一类复杂的调度问题，由于调度涉及任务、资源、时间的三维性，建立HFS调度问题精确的数学模型是非常困难的。

To this problem, the adaptive scheduling algorithms based on scheduling gain and online pulse interleaving are proposed.

针对这一问题，分别提出基于调度收益和基于在线脉冲交错的波束驻留自适应调度算法。

Since the model is a large scale and NP-hard combinational optimization problem in the real navigation environment, a hybrid simulated annealing algorithm is employed to search the suboptimal solution composed of a lockage timetable and a ship scheduling, The search starts by trimming the existing lockage timetable based on heuristic rules; the result is then used to compute the ship scheduling by the depth-first-search algorithm. The obtained solution is finally updated by the Metropolis rule.

本文首先提出了该问题的混合整数非线性规划模型，在实际通航调度环境中，该模型属于强NP-hard复杂度的大规模组合优化问题，因此设计了一种混合模拟退火算法来搜索次优化调度方案，该算法将解分解为闸次时间表和船舶调度计划两部分，在搜索过程中用启发式规则对闸次时间表进行调整，然后用深度优先搜索算法根据闸次时间表求解船舶调度计划，最后根据Metropolis规则对当前解进行更新。

The paper first presents an objective model of task scheduling,and then based on the analysis of Q learning algorithm,the Markov decision process description of the scheduling problem is given.

首先建立任务调度问题的目标模型，在分析 Q学习算法的基础上，给出调度问题的马尔可夫决策过程描述；针对任务调度的 Q学习算法更新速度慢的问题，提出一种基于多步信息更新值函数的多步 Q学习调度算法。

This paper presented a scheduling approach developed to address the scheduling problem of small batch and multiple process routes in job shop environment.

提出一种基于遗传算法的作业计划算法，用于解决作业车间的中小批量多工艺加工作业计划的优化问题。

Course scheduling is a typical portfolio optimization and uncertainty of scheduling problems, but also a complete problem.

排课问题是一个典型的组合优化和不确定性调度问题，也是一个完全问题。

Simulation and optimization of block manufacturing yard scheduling Block manufacturing yard scheduling is a typical NP problem.

分段制造场地计划是典型的NP问题。

Example: One of your duties was doing staff scheduling, and you solved a big scheduling problem.

你的一项职责就是安排员工的工作，而你解决了一项很大的安排问题。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。