CSpace
加工时间可控的单台机器排序问题的近似算法
徐大川
2003
Source Publication数学学报
ISSN0583-1431
Volume046Issue:006Pages:1047
Abstract本文研究加工时间可控的单台机器的赋权的总完工时间问题,它是一个NP难问题,我们利用半定规划松弛的技巧给出它的一个1.2752-近似算法。
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/42383
Collection中国科学院数学与系统科学研究院
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
徐大川. 加工时间可控的单台机器排序问题的近似算法[J]. 数学学报,2003,046(006):1047.
APA 徐大川.(2003).加工时间可控的单台机器排序问题的近似算法.数学学报,046(006),1047.
MLA 徐大川."加工时间可控的单台机器排序问题的近似算法".数学学报 046.006(2003):1047.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[徐大川]'s Articles
Baidu academic
Similar articles in Baidu academic
[徐大川]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[徐大川]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.