给出板坯排序问题的约束满足模型，设计了基于约束满足和启发式混合求解算法。
A constraint satisfaction model is given. A hybrid solving algorithm is designed based on constraint satisfaction and heuristics node exchange algorithm.
为了解决印刷电路板化学处理的排序问题，给出了一个新的单抓钩周期排序的混合整数规划模型，并针对该模型提出了结合线性规划模型的启发式算法。
A new mixed integer linear programming (MILP) model for the single hoist cyclic scheduling is developed, and based on this MILP model, a heuristic method together with linear programming is proposed.
为了解决印刷电路板化学处理的排序问题，给出了一个新的单抓钩周期排序的混合整数规划模型，并针对该模型提出了结合线性规划模型的启发式算法。
A new mixed integer linear programming (MILP) model for the single hoist cyclic scheduling is developed, and based on this MILP model, a heuristic method together with linear programming is proposed.
应用推荐