CSpace
lpt算法的两个近似界估计
何勇1; 林国辉2
1997
Source Publication浙江大学学报自然科学版
ISSN1008-973X
Volume031Issue:002Pages:135
Abstract本文讨论带机器准备时间的平行机排序问题,由于它是NP-hard的,我们讨论近似算法LPT,研究它在使makespan达到最小和minimumcompletiontime达到最大两个目标下近似程度。
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/49903
Collection中国科学院数学与系统科学研究院
Affiliation1.浙江大学
2.中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
何勇,林国辉. lpt算法的两个近似界估计[J]. 浙江大学学报自然科学版,1997,031(002):135.
APA 何勇,&林国辉.(1997).lpt算法的两个近似界估计.浙江大学学报自然科学版,031(002),135.
MLA 何勇,et al."lpt算法的两个近似界估计".浙江大学学报自然科学版 031.002(1997):135.
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
[林国辉]'s Articles
Baidu academic
Similar articles in Baidu academic
[何勇]'s Articles
[林国辉]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[何勇]'s Articles
[林国辉]'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.