摘要
该文考虑了以工件的参数为区间数的单机排序问题.提出了可能度排序问题的方法.讨论了模糊排序中的4个问题,前3个问题利用广义Lawler算法可以多项式求解,最后一个问题证明是NP-困难的.
The single machine scheduling problems with job parameters in the form of interval numbers were considered.A possibility degree approach to sequencing was proposed.Four fuzzy scheduling problems were discussed.The first three problems were solved by using the generalized Lawler＇s algorithm and the last one was proved to be NP-hard even in some restrictive cases.
出处
《曲阜师范大学学报（自然科学版）》
CAS
2013年第3期44-48,共5页
Journal of Qufu Normal University(Natural Science)
基金
the National Natural Science of China(11071142,11201259)
the Natural Science Foundation of Shan Dong Province of China(ZR2010AM034,ZR2011AL017)
关键词
排序
单机
区间数
可能度
scheduling
single machine
interval number
possibility degree
