New models of the Single Machine Weighted Whole-set Orders
In this paper, from the practical application of the complete largest Order number in the single machine scheduling problem, taking advantage of some properties of uncertainty theory, the uncertainty models of the problem are established. A numerical example is given and solved by Hybrid Intelligent Algorithm. The result shows that the models are reasonable and the algorithm is effective.
uncertainty theory uncertain measure uncertain programming whole-set Orders
Meng Wang Xingfang Zhang
School of Mathematical Sciences, Liaocheng University, Liaocheng 252059, China
国际会议
The Second International Conference on Uncertainty Theory(ICUT)(第二届不确定理论国际会议)
拉萨
英文
158-164
2011-08-06(万方平台首次上网日期,不代表论文的发表时间)