Scheduling; Open shop; Mixed integer programming.
排程；开放型工厂；混整数规划。
The scheduling is formalized as a integer programming problem.
该描述将调度问题形式化为整数规划问题。
The problem of bounded nonlinear mixed integer programming is studied.
对一有界约束非线性混合整数规划问题进行了研究。
The number of the most optimal solutions of this integer programming is determined.
给出了一类整数规划问题有唯一最优解的充要条件。
An integrated model is proposed using stochastic mixed integer programming approach.
提出了利用随机混合整数规划方法，建立了一体化模型。
An integer programming model was presented based on the rules of motor train-set operation.
根据动车组运用规则，建立了动车组运用计划整数规划模型。
A mixed integer programming formulation for the off-line version of the problem has been proposed.
给出了问题的数学描述，并对其静态问题，构造了一个混合整数规划模型。
This article investigates lifting method of valid inequality for general integer programming.
有效不等式在整数规划的定界研究中具有重要的意义。
Empirical study shows that mixed integer programming approach has a higher predicting ability.
研究结果表明，混合整数规划法有较强的预测贷款企业信用风险的能力。
In this article, the methods for solution of a nonlinear mixed integer Programming is discussed.
本文讨论一类非线性混合整规划问题的解法。
In this paper it is improved appropriately and applied to the convex integer programming problems.
本文对其做适当改进，用于解凸整数规划问题。
Sort objective values to 0-1 integer programming based on implicit enumerations is firstly analyzed.
结合0 - 1整数规划的隐式枚举法对目标排序法进行分析。
To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。
The method consists of two procedures:fuzzy multicriteria synthetic evaluation and fuzzy integer programming.
该方法由模糊综合评价系统和项目选择的模糊整数规划模型两部分组成。
This paper sets up a mathematic model for the manpower deployment, which is a mixed integer programming model.
建立了兵力展开问题的数学模型，此模型是一个混合整数规划模型。
The process of which is to solve the integer programming problem with the objective function that RMSE is minimal.
选择最优参数的过程即是对以均方根误差最小为目标的整数规划问题的求解过程。
Finally, the optimization of system management would be completed through solving nonlinear mixed integer programming.
最后通过解决非线性混合整数规划，完成系统的优化管理。
Firstly the constraints of weak vertex cover set are analyzed and the integer programming formulation for it is given.
首先分析了弱顶点覆盖集的约束关系，并给出了问题的整数规划形式。
This paper attempts to model capital budgeting problem by chance constrained integer programming with fuzzy decisions.
本文讨论了一类资金预算问题，并建立带有模糊决策的机会约束规划模型的框架。
Finally, the intermodal transportation empty container disposition model, which is Integer Programming, is established.
最后，建立了多式联运集装箱空箱调运整数规划模型。
We will show that the traditional mixed integer programming approach makes the problem difficult to represent and solve.
我们将说明传统的混合整数规划方法使问题难以描述和解决。
The interrelation between the stations is included by the model which is a nonlinear integer programming with logical expression.
模型中考虑了电厂间相互关联，从而得到含有逻辑表达式的非线性整数规划模型。
According to the result of the forecast, with the method of integer programming, the production plan of fracture Wells can be designed.
依据预测结果，利用整数规划的方法，规划设计未来年度油田的压裂井数及压裂方式。
A integer programming model about distribution scheme is set up in this paper, according to the definition of two degrees satisfaction.
以会员订单为依据，分别定义了两种满意度函数，建立了相应分配方案的整数规划模型。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
Be inspired from natural plant growth, this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming.
从大自然植物生长中得到启发，提出了一种求解非线性整数规划全局最小解的仿生算法。
Plant growth simulation algorithm aiming at the global optimization of integer programming is a kind of bionics random algorithm which occurs in nature.
针对整数规划全局优化问题所首次提出的模拟植物生长算法，是一种源于大自然的仿生类随机算法。
Plant growth simulation algorithm aiming at the global optimization of integer programming is a kind of bionics random algorithm which occurs in nature.
针对整数规划全局优化问题所首次提出的模拟植物生长算法，是一种源于大自然的仿生类随机算法。
应用推荐