This paper studies the dynamic hoist scheduling problem and proposes a heuristic method, which method solves the dynamic problem through the solution of a series of static problems.
研究了单抓钩动态排序的问题，提出一个启发式算法，该算法是通过解一系列静态问题来解动态问题的。
In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristic solution is testified.
本文提出组密钥分发的最小准确覆盖问题，并证明一种启发式的解。
A bilevel programming model and heuristic solution algorithm is proposed to model the continuous equilibrium network design problem with elastic demand.
采用双层规划模型描述弹性需求条件下的连续平衡网络设计问题，设计了近似解的启发式算法。
The HEWC problem was formulated as an integer linear program, and an approximation solution was obtained by using LP-relation and rounding heuristic.
HEWC问题第一次被归结为一个整数线性规划问题，并且利用LP的放松问题和有界启发得到一个近似解。
A heuristic method is then proposed to construct a feasible solution of the original problem.
然后依据对偶问题的解，以启发式方法构作原问题的可行解。
In order to search for the optimizing solutions of tool switching problem effectively, a beam search based heuristic algorithm is put forward for formulating heuristic solution space of the problem.
为了有效地搜索到刀具交换问题的优化解，本文提出了基于定向搜索的启发式算法的求解方法。
A programming model and the heuristic solution algorithm are proposed to solve the reserve capacity problem of optimal signal control.
给出了最优信号控制条件下城市交通离散网络设计问题备用能力的优化模型及其启发式求解算法。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
由于在这样的环境中找到一个最优的调度是一个NP难问题，通常运用各种启发式算法来找到近似最优解。
Combining a heuristic random searching strategy with local optimal algorithms is effective solution for complex optimization problem.
启发式随机搜索策略和局部优化算法相结合的求解方案是解决复杂函数优化的有效途径。
The article gives a detailed introduction to the successive heuristic ideas and means among the solution of mathematical problem, and specific examples given.
结合具体的例子，对数学教学中逐次渐进的思想和方法作了详细的介绍。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
应用推荐