schedulingwithrejectionandnonidenticaljobarrivals

CSpace

	schedulingwithrejectionandnonidenticaljobarrivals
	Zhigang Cao 1; Yuzhong Zhang 2
	2007
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	020 期号:004 页码:529
摘要	In this paper, we address the scheduling problem with rejection and non-identical job arrivals, in which we may choose not to process certain jobs and each rejected job incurs a penalty, Our goal is to minimize the sum of the total penalties of the rejected jobs and the maximum completion time of the processed ones, For the off-line variant, we prove its NP-hardness and present a PTAS, and for the on-line special case with two job arrivals, we design a best possible algorithm with competitive ratio （√5＋1/2） .
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/38830
专题	中国科学院数学与系统科学研究院
作者单位	1.中国科学院数学与系统科学研究院 2.曲阜师范大学
推荐引用方式 GB/T 7714	Zhigang Cao,Yuzhong Zhang. schedulingwithrejectionandnonidenticaljobarrivals[J]. journalofsystemsscienceandcomplexity,2007,020(004):529.
APA	Zhigang Cao,&Yuzhong Zhang.(2007).schedulingwithrejectionandnonidenticaljobarrivals.journalofsystemsscienceandcomplexity,020(004),529.
MLA	Zhigang Cao,et al."schedulingwithrejectionandnonidenticaljobarrivals".journalofsystemsscienceandcomplexity 020.004(2007):529.