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.
研究了单抓钩动态排序的问题,提出一个启发式算法,该算法是通过解一系列静态问题来解动态问题的。
2
In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristicsolution is testified.
本文提出组密钥分发的最小准确覆盖问题,并证明一种启发式的解。
3
A bilevel programming model and heuristicsolution algorithm is proposed to model the continuous equilibrium network design problem with elastic demand.