Scheduling with rejection and non-identical job arrivals
文献类型:期刊论文
作者 | Cao, Zhigang1,2; Zhang, Yuzhong2 |
刊名 | JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
![]() |
出版日期 | 2007-12-01 |
卷号 | 20期号:4页码:529-535 |
关键词 | non-identical job arrival on-line rejection scheduling |
ISSN号 | 1009-6124 |
英文摘要 | 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 (root 5+1/2). |
WOS研究方向 | Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000255240600007 |
出版者 | SPRINGER |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/5077] ![]() |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Cao, Zhigang |
作者单位 | 1.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.Qufu Normal Univ, Sch Operat Res & Management Sci, Rizhao 276826, Shandong, Peoples R China |
推荐引用方式 GB/T 7714 | Cao, Zhigang,Zhang, Yuzhong. Scheduling with rejection and non-identical job arrivals[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2007,20(4):529-535. |
APA | Cao, Zhigang,&Zhang, Yuzhong.(2007).Scheduling with rejection and non-identical job arrivals.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,20(4),529-535. |
MLA | Cao, Zhigang,et al."Scheduling with rejection and non-identical job arrivals".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 20.4(2007):529-535. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。