schedulingwithrejectionandnonidenticaljobarrivals
文献类型：期刊论文
| 作者 | Zhigang Cao1; Yuzhong Zhang2 |
| 刊名 | journalofsystemsscienceandcomplexity
 |
| 出版日期 | 2007 |
| 卷号 | 020期号:004页码:529 |
| 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 （√5＋1/2） . |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/38829]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。