The exact bound of Lee's MLPT

CSpace

	The exact bound of Lee's MLPT
	Lin, GH
	1998-07-22
发表期刊	DISCRETE APPLIED MATHEMATICS
ISSN	0166-218X
卷号	85 期号:3 页码:251-254
摘要	Lee provided a modified version of LPT algorithm to deal with the problem Parallel Machines Scheduling with Nonsimultaneous Machine Available Times, and got an upper bound of 4/3 for its worst-case performance ratio. An open question is then proposed to obtain the exact value of this ratio, which is determined in this paper. The instance which achieves the ratio is also demonstrated. (C) 1998 Elsevier Science B.V. All rights reserved.
关键词	MLPT initially worst-case performance ratio
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000074835200006
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14016
专题	中国科学院数学与系统科学研究院
通讯作者	Lin, GH
作者单位	Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Lin, GH. The exact bound of Lee's MLPT[J]. DISCRETE APPLIED MATHEMATICS,1998,85(3):251-254.
APA	Lin, GH.(1998).The exact bound of Lee's MLPT.DISCRETE APPLIED MATHEMATICS,85(3),251-254.
MLA	Lin, GH."The exact bound of Lee's MLPT".DISCRETE APPLIED MATHEMATICS 85.3(1998):251-254.