CSpace
TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS
CHEN, B
1991-05-15
Source PublicationDISCRETE APPLIED MATHEMATICS
ISSN0166-218X
Volume31Issue:3Pages:227-260
AbstractWe examine one of the basic, well studied problem of scheduling theory, that of nonpreemptive assignment of independent tasks on m parallel processors with the objective of minimizing the makespan. Because this problem is NP-complete and apparently intractable in general, much effort has been directed toward devising fast algorithms which find near optimal schedules. Two well-known heuristic algorithms LPT (largest processing time first) and MULTIFIT, shortly MF, find schedules having makespans within 4/3, 13/11, respectively, of the minimum possible makespan, when the m parallel processors are identical. If they are uniform, then the best worst-case performance ratio bounds we know are 1.583, 1.40, respectively. In this paper we tighten the bound to 1.382 for MF algorithm for the uniform-processor system. On the basis of some of our general results and other investigations, we conjecture that the bound could be tightened further to 1.366.
KeywordBIN PACKING MULTIPROCESSOR SCHEDULING HEURISTIC ALGORITHMS UNIFORM PROCESSORS WORST-CASE ANALYSIS PERFORMANCE RATIO
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics, Applied
WOS IDWOS:A1991FQ63600001
PublisherELSEVIER SCIENCE BV
Citation statistics
Cited Times:9[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/28443
Collection中国科学院数学与系统科学研究院
AffiliationCHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
Recommended Citation
GB/T 7714
CHEN, B. TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS[J]. DISCRETE APPLIED MATHEMATICS,1991,31(3):227-260.
APA CHEN, B.(1991).TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS.DISCRETE APPLIED MATHEMATICS,31(3),227-260.
MLA CHEN, B."TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS".DISCRETE APPLIED MATHEMATICS 31.3(1991):227-260.
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
[CHEN, B]'s Articles
Baidu academic
Similar articles in Baidu academic
[CHEN, B]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[CHEN, B]'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.