| 带有不确定时间的单机加权成套订单数问题 |
| |
| 引用本文： | 王猛,张兴芳. 带有不确定时间的单机加权成套订单数问题[J]. 聊城大学学报(自然科学版), 2011, 24(1): 24-26,56 |
| |
| 作者姓名： | 王猛 张兴芳 |
| |
| 作者单位： | 聊城大学,数学科学学院,山东,聊城,252059 |
| |
| 基金项目： | 国家自然科学基金资助项目，聊城大学科研基金项目 |
| |
| 摘 要： | 从实际应用出发,在成套订单数最大的单机排序问题中,加入了不确定量——不确定加工时间,并建立了该问题的不确定模型.利用一套混合智能算法,通过一个算例对这类排序问题进行了说明,计算结果表明了模型的合理性及其算法的有效性.
|
| 关 键 词： | 不确定理论 成套订单数 不确定测度 |
Single with Uncertain Processing Time Weighted Set Order Problem |
| |
| WANG Meng,ZHANG Xing-fang. Single with Uncertain Processing Time Weighted Set Order Problem[J]. JOURNAL OF LIAOCHENG UNIVERSITY (NATURAL SCIENCE, 2011, 24(1): 24-26,56 |
| |
| Authors: | WANG Meng ZHANG Xing-fang |
| |
| Affiliation: | WANG Meng ZHANG Xing-fang(School of Mathematical Sciences,Liaocheng University,Liaocheng 252059,China) |
| |
| Abstract: | From the practical application of the complete largest Order number in the single machine scheduling problem,an uncertainty variable-uncertain processing time is introduced in the article.The uncertainty models of the problem are established in the article.Through the given numerical example is and with the use of Hybrid Intelligent Algorithm,the models are solved.The result shows that the models are reasonable and the algorithm is effective. |
| |
| Keywords: | Uncertainty Theory complete orders uncertain measure |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
